./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.v_non-pipelined-microprocessor.c --full-output --architecture 64bit -------------------------------------------------------------------------------- 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_958282b6-ffe3-4edf-90c9-afd3f3e53f1e/bin/uautomizer-verify-84ZbGMXZE1/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_958282b6-ffe3-4edf-90c9-afd3f3e53f1e/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_958282b6-ffe3-4edf-90c9-afd3f3e53f1e/bin/uautomizer-verify-84ZbGMXZE1/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_958282b6-ffe3-4edf-90c9-afd3f3e53f1e/bin/uautomizer-verify-84ZbGMXZE1/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.v_non-pipelined-microprocessor.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_958282b6-ffe3-4edf-90c9-afd3f3e53f1e/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_958282b6-ffe3-4edf-90c9-afd3f3e53f1e/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 64bit --witnessprinter.graph.data.programhash 013fc4a889617293119ec23d82d2fd495e032e9bab1929da87247ff74d1355ed --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-02 08:24:27,083 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-02 08:24:27,134 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_958282b6-ffe3-4edf-90c9-afd3f3e53f1e/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-12-02 08:24:27,138 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-02 08:24:27,138 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-12-02 08:24:27,157 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-02 08:24:27,158 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-12-02 08:24:27,158 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-12-02 08:24:27,158 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-12-02 08:24:27,158 INFO L153 SettingsManager]: * Use memory slicer=true [2024-12-02 08:24:27,158 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-02 08:24:27,159 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-12-02 08:24:27,159 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-02 08:24:27,159 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-02 08:24:27,159 INFO L153 SettingsManager]: * Use SBE=true [2024-12-02 08:24:27,159 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-02 08:24:27,159 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-02 08:24:27,159 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-02 08:24:27,159 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-02 08:24:27,159 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-02 08:24:27,160 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-02 08:24:27,160 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-02 08:24:27,160 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-02 08:24:27,160 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-02 08:24:27,160 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-02 08:24:27,160 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-12-02 08:24:27,160 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 08:24:27,160 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 08:24:27,160 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 08:24:27,160 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 08:24:27,160 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-02 08:24:27,160 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 08:24:27,160 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 08:24:27,161 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 08:24:27,161 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 08:24:27,161 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-02 08:24:27,161 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-02 08:24:27,161 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-12-02 08:24:27,161 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-02 08:24:27,161 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-12-02 08:24:27,161 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-02 08:24:27,161 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-12-02 08:24:27,161 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-12-02 08:24:27,161 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-12-02 08:24:27,161 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-12-02 08:24:27,161 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_958282b6-ffe3-4edf-90c9-afd3f3e53f1e/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 013fc4a889617293119ec23d82d2fd495e032e9bab1929da87247ff74d1355ed [2024-12-02 08:24:27,358 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-02 08:24:27,365 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-02 08:24:27,367 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-02 08:24:27,368 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-02 08:24:27,368 INFO L274 PluginConnector]: CDTParser initialized [2024-12-02 08:24:27,369 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_958282b6-ffe3-4edf-90c9-afd3f3e53f1e/bin/uautomizer-verify-84ZbGMXZE1/../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.v_non-pipelined-microprocessor.c [2024-12-02 08:24:29,996 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_958282b6-ffe3-4edf-90c9-afd3f3e53f1e/bin/uautomizer-verify-84ZbGMXZE1/data/0c2ea0aeb/935bc819df144dc095dd4e8004b4c092/FLAG33e1262f3 [2024-12-02 08:24:30,214 INFO L384 CDTParser]: Found 1 translation units. [2024-12-02 08:24:30,214 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_958282b6-ffe3-4edf-90c9-afd3f3e53f1e/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.v_non-pipelined-microprocessor.c [2024-12-02 08:24:30,223 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_958282b6-ffe3-4edf-90c9-afd3f3e53f1e/bin/uautomizer-verify-84ZbGMXZE1/data/0c2ea0aeb/935bc819df144dc095dd4e8004b4c092/FLAG33e1262f3 [2024-12-02 08:24:30,543 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_958282b6-ffe3-4edf-90c9-afd3f3e53f1e/bin/uautomizer-verify-84ZbGMXZE1/data/0c2ea0aeb/935bc819df144dc095dd4e8004b4c092 [2024-12-02 08:24:30,544 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-02 08:24:30,545 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-02 08:24:30,546 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-02 08:24:30,546 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-02 08:24:30,549 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-02 08:24:30,550 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:24:30" (1/1) ... [2024-12-02 08:24:30,550 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40d9b2d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:24:30, skipping insertion in model container [2024-12-02 08:24:30,550 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:24:30" (1/1) ... [2024-12-02 08:24:30,572 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-02 08:24:30,687 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_958282b6-ffe3-4edf-90c9-afd3f3e53f1e/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.v_non-pipelined-microprocessor.c[1270,1283] [2024-12-02 08:24:30,816 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 08:24:30,825 INFO L200 MainTranslator]: Completed pre-run [2024-12-02 08:24:30,834 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_958282b6-ffe3-4edf-90c9-afd3f3e53f1e/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.v_non-pipelined-microprocessor.c[1270,1283] [2024-12-02 08:24:30,902 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 08:24:30,912 INFO L204 MainTranslator]: Completed translation [2024-12-02 08:24:30,912 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:24:30 WrapperNode [2024-12-02 08:24:30,912 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-02 08:24:30,913 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-02 08:24:30,913 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-02 08:24:30,913 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-02 08:24:30,919 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:24:30" (1/1) ... [2024-12-02 08:24:30,937 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:24:30" (1/1) ... [2024-12-02 08:24:31,021 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1100 [2024-12-02 08:24:31,022 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-02 08:24:31,022 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-02 08:24:31,022 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-02 08:24:31,023 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-02 08:24:31,029 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:24:30" (1/1) ... [2024-12-02 08:24:31,029 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:24:30" (1/1) ... [2024-12-02 08:24:31,041 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:24:30" (1/1) ... [2024-12-02 08:24:31,091 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 08:24:31,091 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:24:30" (1/1) ... [2024-12-02 08:24:31,091 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:24:30" (1/1) ... [2024-12-02 08:24:31,120 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:24:30" (1/1) ... [2024-12-02 08:24:31,124 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:24:30" (1/1) ... [2024-12-02 08:24:31,130 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:24:30" (1/1) ... [2024-12-02 08:24:31,139 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:24:30" (1/1) ... [2024-12-02 08:24:31,145 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:24:30" (1/1) ... [2024-12-02 08:24:31,194 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-02 08:24:31,195 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-02 08:24:31,195 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-02 08:24:31,195 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-02 08:24:31,196 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:24:30" (1/1) ... [2024-12-02 08:24:31,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 08:24:31,209 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_958282b6-ffe3-4edf-90c9-afd3f3e53f1e/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 08:24:31,218 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_958282b6-ffe3-4edf-90c9-afd3f3e53f1e/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-12-02 08:24:31,220 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_958282b6-ffe3-4edf-90c9-afd3f3e53f1e/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-12-02 08:24:31,240 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-02 08:24:31,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-12-02 08:24:31,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-02 08:24:31,240 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-02 08:24:31,394 INFO L234 CfgBuilder]: Building ICFG [2024-12-02 08:24:31,396 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-02 08:24:32,575 INFO L? ?]: Removed 643 outVars from TransFormulas that were not future-live. [2024-12-02 08:24:32,575 INFO L283 CfgBuilder]: Performing block encoding [2024-12-02 08:24:32,589 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-02 08:24:32,589 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2024-12-02 08:24:32,590 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:24:32 BoogieIcfgContainer [2024-12-02 08:24:32,590 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-02 08:24:32,592 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-12-02 08:24:32,592 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-12-02 08:24:32,596 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-12-02 08:24:32,597 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 08:24:30" (1/3) ... [2024-12-02 08:24:32,597 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d9a6663 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:24:32, skipping insertion in model container [2024-12-02 08:24:32,597 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:24:30" (2/3) ... [2024-12-02 08:24:32,597 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d9a6663 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:24:32, skipping insertion in model container [2024-12-02 08:24:32,597 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:24:32" (3/3) ... [2024-12-02 08:24:32,599 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.v_non-pipelined-microprocessor.c [2024-12-02 08:24:32,612 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-12-02 08:24:32,614 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.v_non-pipelined-microprocessor.c that has 1 procedures, 255 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-12-02 08:24:32,667 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-12-02 08:24:32,678 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;@48058501, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-02 08:24:32,679 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-12-02 08:24:32,683 INFO L276 IsEmpty]: Start isEmpty. Operand has 255 states, 253 states have (on average 1.4980237154150198) internal successors, (379), 254 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:24:32,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-12-02 08:24:32,690 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:24:32,691 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 08:24:32,691 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 08:24:32,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:24:32,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1669955595, now seen corresponding path program 1 times [2024-12-02 08:24:32,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:24:32,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940809506] [2024-12-02 08:24:32,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:24:32,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:24:33,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:24:33,745 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 08:24:33,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:24:33,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940809506] [2024-12-02 08:24:33,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940809506] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:24:33,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:24:33,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 08:24:33,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759017545] [2024-12-02 08:24:33,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:24:33,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 08:24:33,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:24:33,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 08:24:33,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 08:24:33,768 INFO L87 Difference]: Start difference. First operand has 255 states, 253 states have (on average 1.4980237154150198) internal successors, (379), 254 states have internal predecessors, (379), 0 states have call successors, (0), 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 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:24:33,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:24:33,835 INFO L93 Difference]: Finished difference Result 475 states and 709 transitions. [2024-12-02 08:24:33,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 08:24:33,837 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2024-12-02 08:24:33,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:24:33,845 INFO L225 Difference]: With dead ends: 475 [2024-12-02 08:24:33,845 INFO L226 Difference]: Without dead ends: 254 [2024-12-02 08:24:33,848 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 08:24:33,850 INFO L435 NwaCegarLoop]: 373 mSDtfsCounter, 0 mSDsluCounter, 740 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1113 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 08:24:33,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1113 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 08:24:33,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-12-02 08:24:33,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2024-12-02 08:24:33,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 253 states have (on average 1.4901185770750989) internal successors, (377), 253 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:24:33,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 377 transitions. [2024-12-02 08:24:33,887 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 377 transitions. Word has length 77 [2024-12-02 08:24:33,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:24:33,888 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 377 transitions. [2024-12-02 08:24:33,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:24:33,888 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 377 transitions. [2024-12-02 08:24:33,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-12-02 08:24:33,890 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:24:33,890 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 08:24:33,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-12-02 08:24:33,891 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 08:24:33,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:24:33,891 INFO L85 PathProgramCache]: Analyzing trace with hash -227320272, now seen corresponding path program 1 times [2024-12-02 08:24:33,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:24:33,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776773095] [2024-12-02 08:24:33,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:24:33,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:24:33,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:24:34,249 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 08:24:34,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:24:34,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776773095] [2024-12-02 08:24:34,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776773095] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:24:34,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:24:34,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 08:24:34,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593548096] [2024-12-02 08:24:34,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:24:34,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 08:24:34,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:24:34,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 08:24:34,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 08:24:34,252 INFO L87 Difference]: Start difference. First operand 254 states and 377 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:24:34,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:24:34,295 INFO L93 Difference]: Finished difference Result 476 states and 707 transitions. [2024-12-02 08:24:34,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 08:24:34,295 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2024-12-02 08:24:34,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:24:34,297 INFO L225 Difference]: With dead ends: 476 [2024-12-02 08:24:34,297 INFO L226 Difference]: Without dead ends: 256 [2024-12-02 08:24:34,298 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 08:24:34,299 INFO L435 NwaCegarLoop]: 373 mSDtfsCounter, 0 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1109 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 08:24:34,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1109 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 08:24:34,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-12-02 08:24:34,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2024-12-02 08:24:34,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 255 states have (on average 1.4862745098039216) internal successors, (379), 255 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:24:34,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 379 transitions. [2024-12-02 08:24:34,310 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 379 transitions. Word has length 78 [2024-12-02 08:24:34,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:24:34,310 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 379 transitions. [2024-12-02 08:24:34,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:24:34,311 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 379 transitions. [2024-12-02 08:24:34,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-12-02 08:24:34,312 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:24:34,312 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 08:24:34,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-12-02 08:24:34,312 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 08:24:34,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:24:34,313 INFO L85 PathProgramCache]: Analyzing trace with hash 445040686, now seen corresponding path program 1 times [2024-12-02 08:24:34,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:24:34,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742098955] [2024-12-02 08:24:34,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:24:34,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:24:34,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:24:34,968 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 08:24:34,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:24:34,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742098955] [2024-12-02 08:24:34,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742098955] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:24:34,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:24:34,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 08:24:34,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891263350] [2024-12-02 08:24:34,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:24:34,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 08:24:34,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:24:34,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 08:24:34,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-12-02 08:24:34,970 INFO L87 Difference]: Start difference. First operand 256 states and 379 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:24:35,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:24:35,019 INFO L93 Difference]: Finished difference Result 482 states and 714 transitions. [2024-12-02 08:24:35,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 08:24:35,019 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2024-12-02 08:24:35,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:24:35,021 INFO L225 Difference]: With dead ends: 482 [2024-12-02 08:24:35,021 INFO L226 Difference]: Without dead ends: 260 [2024-12-02 08:24:35,022 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-12-02 08:24:35,022 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 310 mSDsluCounter, 735 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 1106 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 08:24:35,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 1106 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 08:24:35,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2024-12-02 08:24:35,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 259. [2024-12-02 08:24:35,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 258 states have (on average 1.4806201550387597) internal successors, (382), 258 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:24:35,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 382 transitions. [2024-12-02 08:24:35,032 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 382 transitions. Word has length 79 [2024-12-02 08:24:35,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:24:35,033 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 382 transitions. [2024-12-02 08:24:35,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:24:35,033 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 382 transitions. [2024-12-02 08:24:35,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-12-02 08:24:35,034 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:24:35,034 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 08:24:35,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-12-02 08:24:35,034 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 08:24:35,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:24:35,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1819062349, now seen corresponding path program 1 times [2024-12-02 08:24:35,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:24:35,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394618365] [2024-12-02 08:24:35,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:24:35,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:24:35,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:24:43,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 08:24:43,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:24:43,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394618365] [2024-12-02 08:24:43,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394618365] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:24:43,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:24:43,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-12-02 08:24:43,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440035403] [2024-12-02 08:24:43,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:24:43,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-12-02 08:24:43,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:24:43,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-12-02 08:24:43,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-12-02 08:24:43,070 INFO L87 Difference]: Start difference. First operand 259 states and 382 transitions. Second operand has 10 states, 10 states have (on average 8.0) internal successors, (80), 10 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:24:46,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:24:46,664 INFO L93 Difference]: Finished difference Result 609 states and 895 transitions. [2024-12-02 08:24:46,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-12-02 08:24:46,665 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.0) internal successors, (80), 10 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2024-12-02 08:24:46,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:24:46,666 INFO L225 Difference]: With dead ends: 609 [2024-12-02 08:24:46,666 INFO L226 Difference]: Without dead ends: 384 [2024-12-02 08:24:46,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2024-12-02 08:24:46,667 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 694 mSDsluCounter, 1051 mSDsCounter, 0 mSdLazyCounter, 1391 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 694 SdHoareTripleChecker+Valid, 1228 SdHoareTripleChecker+Invalid, 1396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-12-02 08:24:46,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [694 Valid, 1228 Invalid, 1396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1391 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-12-02 08:24:46,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2024-12-02 08:24:46,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 261. [2024-12-02 08:24:46,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 260 states have (on average 1.476923076923077) internal successors, (384), 260 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:24:46,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 384 transitions. [2024-12-02 08:24:46,676 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 384 transitions. Word has length 80 [2024-12-02 08:24:46,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:24:46,677 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 384 transitions. [2024-12-02 08:24:46,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.0) internal successors, (80), 10 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:24:46,677 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 384 transitions. [2024-12-02 08:24:46,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-12-02 08:24:46,678 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:24:46,678 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 08:24:46,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-12-02 08:24:46,679 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 08:24:46,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:24:46,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1115207629, now seen corresponding path program 1 times [2024-12-02 08:24:46,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:24:46,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590534529] [2024-12-02 08:24:46,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:24:46,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:24:47,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:24:47,310 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 08:24:47,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:24:47,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590534529] [2024-12-02 08:24:47,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590534529] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:24:47,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:24:47,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 08:24:47,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306081988] [2024-12-02 08:24:47,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:24:47,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 08:24:47,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:24:47,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 08:24:47,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-12-02 08:24:47,311 INFO L87 Difference]: Start difference. First operand 261 states and 384 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:24:47,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:24:47,881 INFO L93 Difference]: Finished difference Result 509 states and 749 transitions. [2024-12-02 08:24:47,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 08:24:47,882 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-12-02 08:24:47,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:24:47,884 INFO L225 Difference]: With dead ends: 509 [2024-12-02 08:24:47,884 INFO L226 Difference]: Without dead ends: 282 [2024-12-02 08:24:47,884 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-12-02 08:24:47,885 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 376 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 854 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 854 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-12-02 08:24:47,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 718 Invalid, 854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 854 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-12-02 08:24:47,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-12-02 08:24:47,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 263. [2024-12-02 08:24:47,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 262 states have (on average 1.4732824427480915) internal successors, (386), 262 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:24:47,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 386 transitions. [2024-12-02 08:24:47,892 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 386 transitions. Word has length 81 [2024-12-02 08:24:47,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:24:47,893 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 386 transitions. [2024-12-02 08:24:47,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:24:47,893 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 386 transitions. [2024-12-02 08:24:47,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-12-02 08:24:47,893 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:24:47,894 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 08:24:47,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-12-02 08:24:47,894 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 08:24:47,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:24:47,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1094728716, now seen corresponding path program 1 times [2024-12-02 08:24:47,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:24:47,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898729715] [2024-12-02 08:24:47,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:24:47,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:24:48,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:24:51,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 08:24:51,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:24:51,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898729715] [2024-12-02 08:24:51,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898729715] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:24:51,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:24:51,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-12-02 08:24:51,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427306948] [2024-12-02 08:24:51,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:24:51,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-12-02 08:24:51,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:24:51,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-12-02 08:24:51,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2024-12-02 08:24:51,240 INFO L87 Difference]: Start difference. First operand 263 states and 386 transitions. Second operand has 16 states, 16 states have (on average 5.0625) internal successors, (81), 16 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:24:53,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:24:53,522 INFO L93 Difference]: Finished difference Result 674 states and 986 transitions. [2024-12-02 08:24:53,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-12-02 08:24:53,524 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.0625) internal successors, (81), 16 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-12-02 08:24:53,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:24:53,526 INFO L225 Difference]: With dead ends: 674 [2024-12-02 08:24:53,526 INFO L226 Difference]: Without dead ends: 445 [2024-12-02 08:24:53,527 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=129, Invalid=627, Unknown=0, NotChecked=0, Total=756 [2024-12-02 08:24:53,528 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 869 mSDsluCounter, 1687 mSDsCounter, 0 mSdLazyCounter, 2891 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 869 SdHoareTripleChecker+Valid, 1907 SdHoareTripleChecker+Invalid, 2893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2891 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-12-02 08:24:53,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [869 Valid, 1907 Invalid, 2893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 2891 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-12-02 08:24:53,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2024-12-02 08:24:53,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 282. [2024-12-02 08:24:53,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 281 states have (on average 1.4768683274021353) internal successors, (415), 281 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:24:53,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 415 transitions. [2024-12-02 08:24:53,537 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 415 transitions. Word has length 81 [2024-12-02 08:24:53,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:24:53,537 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 415 transitions. [2024-12-02 08:24:53,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.0625) internal successors, (81), 16 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:24:53,537 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 415 transitions. [2024-12-02 08:24:53,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-12-02 08:24:53,538 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:24:53,538 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 08:24:53,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-12-02 08:24:53,538 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 08:24:53,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:24:53,539 INFO L85 PathProgramCache]: Analyzing trace with hash 581725629, now seen corresponding path program 1 times [2024-12-02 08:24:53,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:24:53,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874881378] [2024-12-02 08:24:53,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:24:53,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:24:53,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:24:53,787 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 08:24:53,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:24:53,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874881378] [2024-12-02 08:24:53,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874881378] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:24:53,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:24:53,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 08:24:53,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716496718] [2024-12-02 08:24:53,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:24:53,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 08:24:53,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:24:53,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 08:24:53,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-12-02 08:24:53,789 INFO L87 Difference]: Start difference. First operand 282 states and 415 transitions. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:24:53,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:24:53,850 INFO L93 Difference]: Finished difference Result 689 states and 1011 transitions. [2024-12-02 08:24:53,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 08:24:53,851 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2024-12-02 08:24:53,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:24:53,852 INFO L225 Difference]: With dead ends: 689 [2024-12-02 08:24:53,852 INFO L226 Difference]: Without dead ends: 441 [2024-12-02 08:24:53,853 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-12-02 08:24:53,853 INFO L435 NwaCegarLoop]: 364 mSDtfsCounter, 222 mSDsluCounter, 1037 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 1401 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 08:24:53,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 1401 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 08:24:53,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2024-12-02 08:24:53,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 288. [2024-12-02 08:24:53,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 287 states have (on average 1.4738675958188154) internal successors, (423), 287 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:24:53,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 423 transitions. [2024-12-02 08:24:53,862 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 423 transitions. Word has length 82 [2024-12-02 08:24:53,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:24:53,862 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 423 transitions. [2024-12-02 08:24:53,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:24:53,863 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 423 transitions. [2024-12-02 08:24:53,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-12-02 08:24:53,863 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:24:53,863 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 08:24:53,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-12-02 08:24:53,864 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 08:24:53,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:24:53,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1577801930, now seen corresponding path program 1 times [2024-12-02 08:24:53,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:24:53,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938228565] [2024-12-02 08:24:53,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:24:53,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:24:54,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:24:54,328 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 08:24:54,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:24:54,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938228565] [2024-12-02 08:24:54,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938228565] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:24:54,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:24:54,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 08:24:54,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941578940] [2024-12-02 08:24:54,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:24:54,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 08:24:54,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:24:54,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 08:24:54,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-12-02 08:24:54,330 INFO L87 Difference]: Start difference. First operand 288 states and 423 transitions. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:24:54,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:24:54,851 INFO L93 Difference]: Finished difference Result 557 states and 819 transitions. [2024-12-02 08:24:54,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-12-02 08:24:54,852 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2024-12-02 08:24:54,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:24:54,853 INFO L225 Difference]: With dead ends: 557 [2024-12-02 08:24:54,853 INFO L226 Difference]: Without dead ends: 309 [2024-12-02 08:24:54,854 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-12-02 08:24:54,854 INFO L435 NwaCegarLoop]: 340 mSDtfsCounter, 35 mSDsluCounter, 866 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 1206 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-12-02 08:24:54,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 1206 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-12-02 08:24:54,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2024-12-02 08:24:54,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 288. [2024-12-02 08:24:54,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 287 states have (on average 1.4738675958188154) internal successors, (423), 287 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:24:54,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 423 transitions. [2024-12-02 08:24:54,863 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 423 transitions. Word has length 82 [2024-12-02 08:24:54,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:24:54,864 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 423 transitions. [2024-12-02 08:24:54,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:24:54,864 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 423 transitions. [2024-12-02 08:24:54,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-12-02 08:24:54,864 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:24:54,865 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 08:24:54,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-12-02 08:24:54,865 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 08:24:54,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:24:54,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1389606502, now seen corresponding path program 1 times [2024-12-02 08:24:54,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:24:54,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340235692] [2024-12-02 08:24:54,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:24:54,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:24:55,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:24:55,683 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 08:24:55,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:24:55,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340235692] [2024-12-02 08:24:55,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340235692] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:24:55,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:24:55,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-12-02 08:24:55,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41645934] [2024-12-02 08:24:55,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:24:55,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-12-02 08:24:55,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:24:55,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-12-02 08:24:55,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-12-02 08:24:55,685 INFO L87 Difference]: Start difference. First operand 288 states and 423 transitions. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:24:56,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:24:56,412 INFO L93 Difference]: Finished difference Result 656 states and 960 transitions. [2024-12-02 08:24:56,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 08:24:56,413 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2024-12-02 08:24:56,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:24:56,415 INFO L225 Difference]: With dead ends: 656 [2024-12-02 08:24:56,415 INFO L226 Difference]: Without dead ends: 408 [2024-12-02 08:24:56,415 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-12-02 08:24:56,416 INFO L435 NwaCegarLoop]: 252 mSDtfsCounter, 519 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 1034 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 519 SdHoareTripleChecker+Valid, 929 SdHoareTripleChecker+Invalid, 1035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-12-02 08:24:56,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [519 Valid, 929 Invalid, 1035 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1034 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-12-02 08:24:56,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2024-12-02 08:24:56,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 291. [2024-12-02 08:24:56,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 290 states have (on average 1.4689655172413794) internal successors, (426), 290 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:24:56,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 426 transitions. [2024-12-02 08:24:56,425 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 426 transitions. Word has length 82 [2024-12-02 08:24:56,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:24:56,425 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 426 transitions. [2024-12-02 08:24:56,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:24:56,426 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 426 transitions. [2024-12-02 08:24:56,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-12-02 08:24:56,426 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:24:56,426 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 08:24:56,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-12-02 08:24:56,427 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 08:24:56,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:24:56,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1449177706, now seen corresponding path program 1 times [2024-12-02 08:24:56,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:24:56,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81357075] [2024-12-02 08:24:56,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:24:56,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:24:56,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:24:59,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 08:24:59,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:24:59,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81357075] [2024-12-02 08:24:59,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81357075] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:24:59,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:24:59,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-12-02 08:24:59,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159383191] [2024-12-02 08:24:59,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:24:59,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-12-02 08:24:59,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:24:59,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-12-02 08:24:59,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2024-12-02 08:24:59,465 INFO L87 Difference]: Start difference. First operand 291 states and 426 transitions. Second operand has 17 states, 17 states have (on average 4.823529411764706) internal successors, (82), 17 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:00,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:25:00,985 INFO L93 Difference]: Finished difference Result 720 states and 1049 transitions. [2024-12-02 08:25:00,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-12-02 08:25:00,986 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.823529411764706) internal successors, (82), 17 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2024-12-02 08:25:00,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:25:00,987 INFO L225 Difference]: With dead ends: 720 [2024-12-02 08:25:00,987 INFO L226 Difference]: Without dead ends: 469 [2024-12-02 08:25:00,988 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=146, Invalid=724, Unknown=0, NotChecked=0, Total=870 [2024-12-02 08:25:00,988 INFO L435 NwaCegarLoop]: 390 mSDtfsCounter, 832 mSDsluCounter, 3458 mSDsCounter, 0 mSdLazyCounter, 1768 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 832 SdHoareTripleChecker+Valid, 3848 SdHoareTripleChecker+Invalid, 1771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-12-02 08:25:00,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [832 Valid, 3848 Invalid, 1771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1768 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-12-02 08:25:00,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2024-12-02 08:25:00,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 303. [2024-12-02 08:25:00,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 302 states have (on average 1.4701986754966887) internal successors, (444), 302 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:00,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 444 transitions. [2024-12-02 08:25:00,995 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 444 transitions. Word has length 82 [2024-12-02 08:25:00,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:25:00,995 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 444 transitions. [2024-12-02 08:25:00,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.823529411764706) internal successors, (82), 17 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:00,995 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 444 transitions. [2024-12-02 08:25:00,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-12-02 08:25:00,996 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:25:00,996 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 08:25:00,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-12-02 08:25:00,996 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 08:25:00,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:25:00,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1093418607, now seen corresponding path program 1 times [2024-12-02 08:25:00,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:25:00,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962855590] [2024-12-02 08:25:00,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:25:00,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:25:01,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:25:01,300 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 08:25:01,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:25:01,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962855590] [2024-12-02 08:25:01,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962855590] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:25:01,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:25:01,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 08:25:01,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732079510] [2024-12-02 08:25:01,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:25:01,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 08:25:01,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:25:01,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 08:25:01,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-12-02 08:25:01,302 INFO L87 Difference]: Start difference. First operand 303 states and 444 transitions. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:01,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:25:01,345 INFO L93 Difference]: Finished difference Result 732 states and 1070 transitions. [2024-12-02 08:25:01,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 08:25:01,345 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2024-12-02 08:25:01,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:25:01,347 INFO L225 Difference]: With dead ends: 732 [2024-12-02 08:25:01,347 INFO L226 Difference]: Without dead ends: 469 [2024-12-02 08:25:01,347 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-12-02 08:25:01,348 INFO L435 NwaCegarLoop]: 364 mSDtfsCounter, 214 mSDsluCounter, 1037 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 1401 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 08:25:01,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 1401 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 08:25:01,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2024-12-02 08:25:01,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 311. [2024-12-02 08:25:01,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 310 states have (on average 1.4645161290322581) internal successors, (454), 310 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:01,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 454 transitions. [2024-12-02 08:25:01,357 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 454 transitions. Word has length 82 [2024-12-02 08:25:01,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:25:01,357 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 454 transitions. [2024-12-02 08:25:01,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:01,357 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 454 transitions. [2024-12-02 08:25:01,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-12-02 08:25:01,358 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:25:01,358 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 08:25:01,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-12-02 08:25:01,359 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 08:25:01,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:25:01,359 INFO L85 PathProgramCache]: Analyzing trace with hash -536700682, now seen corresponding path program 1 times [2024-12-02 08:25:01,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:25:01,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662929330] [2024-12-02 08:25:01,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:25:01,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:25:01,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:25:01,603 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 08:25:01,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:25:01,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662929330] [2024-12-02 08:25:01,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662929330] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:25:01,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:25:01,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 08:25:01,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963220261] [2024-12-02 08:25:01,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:25:01,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 08:25:01,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:25:01,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 08:25:01,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-12-02 08:25:01,604 INFO L87 Difference]: Start difference. First operand 311 states and 454 transitions. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:01,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:25:01,648 INFO L93 Difference]: Finished difference Result 717 states and 1045 transitions. [2024-12-02 08:25:01,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 08:25:01,648 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2024-12-02 08:25:01,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:25:01,649 INFO L225 Difference]: With dead ends: 717 [2024-12-02 08:25:01,649 INFO L226 Difference]: Without dead ends: 450 [2024-12-02 08:25:01,650 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-12-02 08:25:01,650 INFO L435 NwaCegarLoop]: 364 mSDtfsCounter, 212 mSDsluCounter, 1037 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 1401 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 08:25:01,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 1401 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 08:25:01,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2024-12-02 08:25:01,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 307. [2024-12-02 08:25:01,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 306 states have (on average 1.4640522875816993) internal successors, (448), 306 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:01,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 448 transitions. [2024-12-02 08:25:01,655 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 448 transitions. Word has length 82 [2024-12-02 08:25:01,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:25:01,655 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 448 transitions. [2024-12-02 08:25:01,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:01,655 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 448 transitions. [2024-12-02 08:25:01,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-12-02 08:25:01,656 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:25:01,656 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 08:25:01,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-12-02 08:25:01,656 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 08:25:01,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:25:01,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1449839351, now seen corresponding path program 1 times [2024-12-02 08:25:01,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:25:01,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207153949] [2024-12-02 08:25:01,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:25:01,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:25:01,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:25:02,054 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 08:25:02,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:25:02,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207153949] [2024-12-02 08:25:02,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207153949] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:25:02,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:25:02,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 08:25:02,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022443164] [2024-12-02 08:25:02,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:25:02,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 08:25:02,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:25:02,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 08:25:02,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-12-02 08:25:02,056 INFO L87 Difference]: Start difference. First operand 307 states and 448 transitions. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:02,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:25:02,513 INFO L93 Difference]: Finished difference Result 589 states and 862 transitions. [2024-12-02 08:25:02,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-12-02 08:25:02,514 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2024-12-02 08:25:02,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:25:02,514 INFO L225 Difference]: With dead ends: 589 [2024-12-02 08:25:02,514 INFO L226 Difference]: Without dead ends: 326 [2024-12-02 08:25:02,515 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-12-02 08:25:02,515 INFO L435 NwaCegarLoop]: 360 mSDtfsCounter, 31 mSDsluCounter, 886 mSDsCounter, 0 mSdLazyCounter, 695 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 1246 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-12-02 08:25:02,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 1246 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 695 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-12-02 08:25:02,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2024-12-02 08:25:02,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 311. [2024-12-02 08:25:02,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 310 states have (on average 1.461290322580645) internal successors, (453), 310 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:02,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 453 transitions. [2024-12-02 08:25:02,521 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 453 transitions. Word has length 83 [2024-12-02 08:25:02,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:25:02,521 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 453 transitions. [2024-12-02 08:25:02,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:02,522 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 453 transitions. [2024-12-02 08:25:02,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-12-02 08:25:02,522 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:25:02,522 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 08:25:02,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-12-02 08:25:02,523 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 08:25:02,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:25:02,523 INFO L85 PathProgramCache]: Analyzing trace with hash 502456058, now seen corresponding path program 1 times [2024-12-02 08:25:02,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:25:02,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042523707] [2024-12-02 08:25:02,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:25:02,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:25:02,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:25:02,762 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 08:25:02,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:25:02,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042523707] [2024-12-02 08:25:02,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042523707] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:25:02,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:25:02,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 08:25:02,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067352111] [2024-12-02 08:25:02,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:25:02,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 08:25:02,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:25:02,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 08:25:02,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 08:25:02,764 INFO L87 Difference]: Start difference. First operand 311 states and 453 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:02,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:25:02,811 INFO L93 Difference]: Finished difference Result 703 states and 1021 transitions. [2024-12-02 08:25:02,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 08:25:02,812 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2024-12-02 08:25:02,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:25:02,812 INFO L225 Difference]: With dead ends: 703 [2024-12-02 08:25:02,813 INFO L226 Difference]: Without dead ends: 436 [2024-12-02 08:25:02,813 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-12-02 08:25:02,813 INFO L435 NwaCegarLoop]: 364 mSDtfsCounter, 201 mSDsluCounter, 1037 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 1401 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 08:25:02,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 1401 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 08:25:02,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2024-12-02 08:25:02,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 313. [2024-12-02 08:25:02,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 312 states have (on average 1.4583333333333333) internal successors, (455), 312 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:02,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 455 transitions. [2024-12-02 08:25:02,819 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 455 transitions. Word has length 83 [2024-12-02 08:25:02,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:25:02,820 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 455 transitions. [2024-12-02 08:25:02,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:02,820 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 455 transitions. [2024-12-02 08:25:02,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-12-02 08:25:02,820 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:25:02,820 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 08:25:02,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-12-02 08:25:02,820 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 08:25:02,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:25:02,821 INFO L85 PathProgramCache]: Analyzing trace with hash 155342589, now seen corresponding path program 1 times [2024-12-02 08:25:02,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:25:02,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056812505] [2024-12-02 08:25:02,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:25:02,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:25:03,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:25:03,259 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 08:25:03,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:25:03,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056812505] [2024-12-02 08:25:03,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056812505] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:25:03,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:25:03,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-12-02 08:25:03,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255050617] [2024-12-02 08:25:03,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:25:03,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-12-02 08:25:03,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:25:03,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-12-02 08:25:03,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-12-02 08:25:03,260 INFO L87 Difference]: Start difference. First operand 313 states and 455 transitions. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:04,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:25:04,018 INFO L93 Difference]: Finished difference Result 697 states and 1013 transitions. [2024-12-02 08:25:04,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-12-02 08:25:04,019 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2024-12-02 08:25:04,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:25:04,021 INFO L225 Difference]: With dead ends: 697 [2024-12-02 08:25:04,021 INFO L226 Difference]: Without dead ends: 430 [2024-12-02 08:25:04,021 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-12-02 08:25:04,022 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 569 mSDsluCounter, 904 mSDsCounter, 0 mSdLazyCounter, 1316 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 569 SdHoareTripleChecker+Valid, 1150 SdHoareTripleChecker+Invalid, 1317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-12-02 08:25:04,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [569 Valid, 1150 Invalid, 1317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1316 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-12-02 08:25:04,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2024-12-02 08:25:04,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 317. [2024-12-02 08:25:04,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 316 states have (on average 1.4525316455696202) internal successors, (459), 316 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:04,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 459 transitions. [2024-12-02 08:25:04,026 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 459 transitions. Word has length 84 [2024-12-02 08:25:04,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:25:04,027 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 459 transitions. [2024-12-02 08:25:04,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:04,027 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 459 transitions. [2024-12-02 08:25:04,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-12-02 08:25:04,027 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:25:04,027 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 08:25:04,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-12-02 08:25:04,028 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 08:25:04,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:25:04,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1492432321, now seen corresponding path program 1 times [2024-12-02 08:25:04,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:25:04,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106835387] [2024-12-02 08:25:04,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:25:04,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:25:04,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:25:04,509 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 08:25:04,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:25:04,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106835387] [2024-12-02 08:25:04,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106835387] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:25:04,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:25:04,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 08:25:04,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163258578] [2024-12-02 08:25:04,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:25:04,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 08:25:04,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:25:04,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 08:25:04,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-12-02 08:25:04,510 INFO L87 Difference]: Start difference. First operand 317 states and 459 transitions. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:05,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:25:05,232 INFO L93 Difference]: Finished difference Result 716 states and 1037 transitions. [2024-12-02 08:25:05,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 08:25:05,233 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2024-12-02 08:25:05,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:25:05,233 INFO L225 Difference]: With dead ends: 716 [2024-12-02 08:25:05,233 INFO L226 Difference]: Without dead ends: 445 [2024-12-02 08:25:05,234 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-12-02 08:25:05,234 INFO L435 NwaCegarLoop]: 254 mSDtfsCounter, 514 mSDsluCounter, 679 mSDsCounter, 0 mSdLazyCounter, 1048 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 514 SdHoareTripleChecker+Valid, 933 SdHoareTripleChecker+Invalid, 1048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-12-02 08:25:05,234 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [514 Valid, 933 Invalid, 1048 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1048 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-12-02 08:25:05,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2024-12-02 08:25:05,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 322. [2024-12-02 08:25:05,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 321 states have (on average 1.4485981308411215) internal successors, (465), 321 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:05,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 465 transitions. [2024-12-02 08:25:05,239 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 465 transitions. Word has length 84 [2024-12-02 08:25:05,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:25:05,239 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 465 transitions. [2024-12-02 08:25:05,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:05,240 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 465 transitions. [2024-12-02 08:25:05,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-12-02 08:25:05,240 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:25:05,240 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 08:25:05,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-12-02 08:25:05,241 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 08:25:05,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:25:05,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1048327525, now seen corresponding path program 1 times [2024-12-02 08:25:05,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:25:05,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191102341] [2024-12-02 08:25:05,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:25:05,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:25:05,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:25:05,735 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 08:25:05,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:25:05,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191102341] [2024-12-02 08:25:05,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191102341] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:25:05,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:25:05,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-12-02 08:25:05,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880310794] [2024-12-02 08:25:05,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:25:05,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-12-02 08:25:05,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:25:05,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-12-02 08:25:05,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-12-02 08:25:05,736 INFO L87 Difference]: Start difference. First operand 322 states and 465 transitions. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:06,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:25:06,564 INFO L93 Difference]: Finished difference Result 711 states and 1028 transitions. [2024-12-02 08:25:06,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-12-02 08:25:06,564 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2024-12-02 08:25:06,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:25:06,566 INFO L225 Difference]: With dead ends: 711 [2024-12-02 08:25:06,566 INFO L226 Difference]: Without dead ends: 435 [2024-12-02 08:25:06,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-12-02 08:25:06,566 INFO L435 NwaCegarLoop]: 245 mSDtfsCounter, 540 mSDsluCounter, 1141 mSDsCounter, 0 mSdLazyCounter, 1571 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 540 SdHoareTripleChecker+Valid, 1386 SdHoareTripleChecker+Invalid, 1572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-12-02 08:25:06,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [540 Valid, 1386 Invalid, 1572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1571 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-12-02 08:25:06,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2024-12-02 08:25:06,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 326. [2024-12-02 08:25:06,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 325 states have (on average 1.4430769230769231) internal successors, (469), 325 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:06,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 469 transitions. [2024-12-02 08:25:06,571 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 469 transitions. Word has length 85 [2024-12-02 08:25:06,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:25:06,571 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 469 transitions. [2024-12-02 08:25:06,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:06,571 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 469 transitions. [2024-12-02 08:25:06,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-12-02 08:25:06,572 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:25:06,572 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 08:25:06,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-12-02 08:25:06,572 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 08:25:06,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:25:06,572 INFO L85 PathProgramCache]: Analyzing trace with hash 58683094, now seen corresponding path program 1 times [2024-12-02 08:25:06,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:25:06,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003073672] [2024-12-02 08:25:06,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:25:06,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:25:06,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:25:07,049 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 08:25:07,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:25:07,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003073672] [2024-12-02 08:25:07,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003073672] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:25:07,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:25:07,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-12-02 08:25:07,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681900381] [2024-12-02 08:25:07,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:25:07,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-12-02 08:25:07,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:25:07,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-12-02 08:25:07,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-12-02 08:25:07,050 INFO L87 Difference]: Start difference. First operand 326 states and 469 transitions. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:07,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:25:07,986 INFO L93 Difference]: Finished difference Result 729 states and 1050 transitions. [2024-12-02 08:25:07,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-12-02 08:25:07,986 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2024-12-02 08:25:07,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:25:07,988 INFO L225 Difference]: With dead ends: 729 [2024-12-02 08:25:07,988 INFO L226 Difference]: Without dead ends: 449 [2024-12-02 08:25:07,988 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2024-12-02 08:25:07,988 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 542 mSDsluCounter, 1145 mSDsCounter, 0 mSdLazyCounter, 1628 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 542 SdHoareTripleChecker+Valid, 1393 SdHoareTripleChecker+Invalid, 1628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-12-02 08:25:07,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [542 Valid, 1393 Invalid, 1628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1628 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-12-02 08:25:07,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2024-12-02 08:25:07,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 333. [2024-12-02 08:25:07,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 332 states have (on average 1.4367469879518073) internal successors, (477), 332 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:07,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 477 transitions. [2024-12-02 08:25:07,995 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 477 transitions. Word has length 85 [2024-12-02 08:25:07,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:25:07,995 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 477 transitions. [2024-12-02 08:25:07,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:07,995 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 477 transitions. [2024-12-02 08:25:07,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-12-02 08:25:07,996 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:25:07,996 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 08:25:07,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-12-02 08:25:07,996 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 08:25:07,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:25:07,996 INFO L85 PathProgramCache]: Analyzing trace with hash 674152439, now seen corresponding path program 1 times [2024-12-02 08:25:07,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:25:07,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715738945] [2024-12-02 08:25:07,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:25:07,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:25:08,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:25:08,430 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 08:25:08,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:25:08,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715738945] [2024-12-02 08:25:08,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715738945] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:25:08,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:25:08,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 08:25:08,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586946075] [2024-12-02 08:25:08,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:25:08,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 08:25:08,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:25:08,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 08:25:08,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-12-02 08:25:08,431 INFO L87 Difference]: Start difference. First operand 333 states and 477 transitions. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:08,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:25:08,861 INFO L93 Difference]: Finished difference Result 641 states and 919 transitions. [2024-12-02 08:25:08,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 08:25:08,861 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2024-12-02 08:25:08,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:25:08,862 INFO L225 Difference]: With dead ends: 641 [2024-12-02 08:25:08,862 INFO L226 Difference]: Without dead ends: 354 [2024-12-02 08:25:08,862 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-12-02 08:25:08,863 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 368 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 842 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 842 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-12-02 08:25:08,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 718 Invalid, 842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 842 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-12-02 08:25:08,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2024-12-02 08:25:08,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 343. [2024-12-02 08:25:08,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 342 states have (on average 1.4298245614035088) internal successors, (489), 342 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:08,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 489 transitions. [2024-12-02 08:25:08,867 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 489 transitions. Word has length 85 [2024-12-02 08:25:08,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:25:08,867 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 489 transitions. [2024-12-02 08:25:08,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:08,867 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 489 transitions. [2024-12-02 08:25:08,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-12-02 08:25:08,868 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:25:08,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, 1, 1, 1, 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 08:25:08,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-12-02 08:25:08,868 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 08:25:08,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:25:08,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1490432804, now seen corresponding path program 1 times [2024-12-02 08:25:08,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:25:08,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925963934] [2024-12-02 08:25:08,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:25:08,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:25:09,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:25:09,299 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 08:25:09,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:25:09,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925963934] [2024-12-02 08:25:09,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925963934] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:25:09,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:25:09,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-12-02 08:25:09,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046711670] [2024-12-02 08:25:09,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:25:09,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-12-02 08:25:09,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:25:09,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-12-02 08:25:09,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-12-02 08:25:09,301 INFO L87 Difference]: Start difference. First operand 343 states and 489 transitions. Second operand has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:09,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:25:09,845 INFO L93 Difference]: Finished difference Result 653 states and 933 transitions. [2024-12-02 08:25:09,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-12-02 08:25:09,845 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2024-12-02 08:25:09,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:25:09,846 INFO L225 Difference]: With dead ends: 653 [2024-12-02 08:25:09,846 INFO L226 Difference]: Without dead ends: 356 [2024-12-02 08:25:09,846 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-12-02 08:25:09,846 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 398 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 976 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 888 SdHoareTripleChecker+Invalid, 978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-12-02 08:25:09,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 888 Invalid, 978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 976 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-12-02 08:25:09,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2024-12-02 08:25:09,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 335. [2024-12-02 08:25:09,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 334 states have (on average 1.4341317365269461) internal successors, (479), 334 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:09,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 479 transitions. [2024-12-02 08:25:09,853 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 479 transitions. Word has length 86 [2024-12-02 08:25:09,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:25:09,853 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 479 transitions. [2024-12-02 08:25:09,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:09,854 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 479 transitions. [2024-12-02 08:25:09,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-12-02 08:25:09,854 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:25:09,854 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 08:25:09,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-12-02 08:25:09,854 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 08:25:09,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:25:09,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1058146460, now seen corresponding path program 1 times [2024-12-02 08:25:09,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:25:09,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626298208] [2024-12-02 08:25:09,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:25:09,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:25:10,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:25:10,293 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 08:25:10,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:25:10,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626298208] [2024-12-02 08:25:10,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626298208] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:25:10,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:25:10,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 08:25:10,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920557785] [2024-12-02 08:25:10,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:25:10,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 08:25:10,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:25:10,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 08:25:10,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-12-02 08:25:10,294 INFO L87 Difference]: Start difference. First operand 335 states and 479 transitions. Second operand has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:10,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:25:10,690 INFO L93 Difference]: Finished difference Result 645 states and 922 transitions. [2024-12-02 08:25:10,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 08:25:10,690 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2024-12-02 08:25:10,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:25:10,691 INFO L225 Difference]: With dead ends: 645 [2024-12-02 08:25:10,691 INFO L226 Difference]: Without dead ends: 356 [2024-12-02 08:25:10,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-12-02 08:25:10,692 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 371 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 826 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-12-02 08:25:10,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 717 Invalid, 826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 826 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-12-02 08:25:10,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2024-12-02 08:25:10,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 349. [2024-12-02 08:25:10,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 348 states have (on average 1.4252873563218391) internal successors, (496), 348 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:10,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 496 transitions. [2024-12-02 08:25:10,696 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 496 transitions. Word has length 86 [2024-12-02 08:25:10,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:25:10,696 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 496 transitions. [2024-12-02 08:25:10,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:10,696 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 496 transitions. [2024-12-02 08:25:10,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-12-02 08:25:10,697 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:25:10,697 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 08:25:10,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-12-02 08:25:10,697 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 08:25:10,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:25:10,698 INFO L85 PathProgramCache]: Analyzing trace with hash 559187743, now seen corresponding path program 1 times [2024-12-02 08:25:10,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:25:10,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487880584] [2024-12-02 08:25:10,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:25:10,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:25:10,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:25:11,106 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 08:25:11,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:25:11,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487880584] [2024-12-02 08:25:11,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487880584] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:25:11,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:25:11,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 08:25:11,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229541057] [2024-12-02 08:25:11,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:25:11,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 08:25:11,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:25:11,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 08:25:11,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-12-02 08:25:11,108 INFO L87 Difference]: Start difference. First operand 349 states and 496 transitions. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:11,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:25:11,492 INFO L93 Difference]: Finished difference Result 667 states and 949 transitions. [2024-12-02 08:25:11,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-12-02 08:25:11,492 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2024-12-02 08:25:11,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:25:11,493 INFO L225 Difference]: With dead ends: 667 [2024-12-02 08:25:11,493 INFO L226 Difference]: Without dead ends: 364 [2024-12-02 08:25:11,493 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-12-02 08:25:11,494 INFO L435 NwaCegarLoop]: 343 mSDtfsCounter, 21 mSDsluCounter, 869 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1212 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-12-02 08:25:11,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1212 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 652 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-12-02 08:25:11,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2024-12-02 08:25:11,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 343. [2024-12-02 08:25:11,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 342 states have (on average 1.4298245614035088) internal successors, (489), 342 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:11,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 489 transitions. [2024-12-02 08:25:11,499 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 489 transitions. Word has length 87 [2024-12-02 08:25:11,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:25:11,499 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 489 transitions. [2024-12-02 08:25:11,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:11,499 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 489 transitions. [2024-12-02 08:25:11,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-12-02 08:25:11,500 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:25:11,500 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 08:25:11,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-12-02 08:25:11,500 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 08:25:11,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:25:11,500 INFO L85 PathProgramCache]: Analyzing trace with hash -943533890, now seen corresponding path program 1 times [2024-12-02 08:25:11,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:25:11,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648811803] [2024-12-02 08:25:11,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:25:11,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:25:11,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:25:11,885 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 08:25:11,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:25:11,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648811803] [2024-12-02 08:25:11,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648811803] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:25:11,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:25:11,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 08:25:11,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289413361] [2024-12-02 08:25:11,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:25:11,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 08:25:11,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:25:11,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 08:25:11,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-12-02 08:25:11,887 INFO L87 Difference]: Start difference. First operand 343 states and 489 transitions. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:12,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:25:12,351 INFO L93 Difference]: Finished difference Result 661 states and 941 transitions. [2024-12-02 08:25:12,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 08:25:12,351 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2024-12-02 08:25:12,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:25:12,352 INFO L225 Difference]: With dead ends: 661 [2024-12-02 08:25:12,352 INFO L226 Difference]: Without dead ends: 364 [2024-12-02 08:25:12,352 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-12-02 08:25:12,352 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 372 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-12-02 08:25:12,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 715 Invalid, 810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 810 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-12-02 08:25:12,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2024-12-02 08:25:12,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 361. [2024-12-02 08:25:12,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 360 states have (on average 1.4194444444444445) internal successors, (511), 360 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:12,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 511 transitions. [2024-12-02 08:25:12,357 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 511 transitions. Word has length 87 [2024-12-02 08:25:12,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:25:12,357 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 511 transitions. [2024-12-02 08:25:12,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:12,357 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 511 transitions. [2024-12-02 08:25:12,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-12-02 08:25:12,357 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:25:12,357 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 08:25:12,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-12-02 08:25:12,357 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 08:25:12,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:25:12,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1949186147, now seen corresponding path program 1 times [2024-12-02 08:25:12,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:25:12,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476770810] [2024-12-02 08:25:12,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:25:12,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:25:12,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:25:12,876 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 08:25:12,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:25:12,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476770810] [2024-12-02 08:25:12,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476770810] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:25:12,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:25:12,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-12-02 08:25:12,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754757581] [2024-12-02 08:25:12,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:25:12,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-12-02 08:25:12,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:25:12,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-12-02 08:25:12,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-12-02 08:25:12,878 INFO L87 Difference]: Start difference. First operand 361 states and 511 transitions. Second operand has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:13,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:25:13,635 INFO L93 Difference]: Finished difference Result 785 states and 1113 transitions. [2024-12-02 08:25:13,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-12-02 08:25:13,635 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2024-12-02 08:25:13,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:25:13,636 INFO L225 Difference]: With dead ends: 785 [2024-12-02 08:25:13,636 INFO L226 Difference]: Without dead ends: 470 [2024-12-02 08:25:13,636 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-12-02 08:25:13,637 INFO L435 NwaCegarLoop]: 245 mSDtfsCounter, 545 mSDsluCounter, 901 mSDsCounter, 0 mSdLazyCounter, 1293 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 1146 SdHoareTripleChecker+Invalid, 1294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-12-02 08:25:13,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [545 Valid, 1146 Invalid, 1294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1293 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-12-02 08:25:13,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2024-12-02 08:25:13,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 365. [2024-12-02 08:25:13,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 364 states have (on average 1.414835164835165) internal successors, (515), 364 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:13,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 515 transitions. [2024-12-02 08:25:13,641 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 515 transitions. Word has length 88 [2024-12-02 08:25:13,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:25:13,641 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 515 transitions. [2024-12-02 08:25:13,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:13,641 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 515 transitions. [2024-12-02 08:25:13,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-12-02 08:25:13,642 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:25:13,642 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:25:13,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-12-02 08:25:13,642 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 08:25:13,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:25:13,642 INFO L85 PathProgramCache]: Analyzing trace with hash -344330263, now seen corresponding path program 1 times [2024-12-02 08:25:13,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:25:13,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351945097] [2024-12-02 08:25:13,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:25:13,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:25:13,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:25:14,181 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 08:25:14,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:25:14,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351945097] [2024-12-02 08:25:14,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351945097] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:25:14,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:25:14,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-12-02 08:25:14,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479663320] [2024-12-02 08:25:14,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:25:14,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-12-02 08:25:14,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:25:14,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-12-02 08:25:14,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-12-02 08:25:14,182 INFO L87 Difference]: Start difference. First operand 365 states and 515 transitions. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:15,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:25:15,061 INFO L93 Difference]: Finished difference Result 810 states and 1144 transitions. [2024-12-02 08:25:15,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-12-02 08:25:15,062 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2024-12-02 08:25:15,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:25:15,063 INFO L225 Difference]: With dead ends: 810 [2024-12-02 08:25:15,063 INFO L226 Difference]: Without dead ends: 491 [2024-12-02 08:25:15,063 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-12-02 08:25:15,064 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 538 mSDsluCounter, 906 mSDsCounter, 0 mSdLazyCounter, 1324 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 538 SdHoareTripleChecker+Valid, 1154 SdHoareTripleChecker+Invalid, 1324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-12-02 08:25:15,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [538 Valid, 1154 Invalid, 1324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1324 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-12-02 08:25:15,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2024-12-02 08:25:15,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 373. [2024-12-02 08:25:15,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 372 states have (on average 1.4086021505376345) internal successors, (524), 372 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:15,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 524 transitions. [2024-12-02 08:25:15,068 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 524 transitions. Word has length 88 [2024-12-02 08:25:15,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:25:15,069 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 524 transitions. [2024-12-02 08:25:15,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:15,069 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 524 transitions. [2024-12-02 08:25:15,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-12-02 08:25:15,069 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:25:15,069 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 08:25:15,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-12-02 08:25:15,070 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 08:25:15,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:25:15,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1154319847, now seen corresponding path program 1 times [2024-12-02 08:25:15,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:25:15,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932920161] [2024-12-02 08:25:15,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:25:15,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:25:15,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:25:15,538 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 08:25:15,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:25:15,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932920161] [2024-12-02 08:25:15,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932920161] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:25:15,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:25:15,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-12-02 08:25:15,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011408438] [2024-12-02 08:25:15,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:25:15,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-12-02 08:25:15,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:25:15,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-12-02 08:25:15,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-12-02 08:25:15,540 INFO L87 Difference]: Start difference. First operand 373 states and 524 transitions. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:16,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:25:16,048 INFO L93 Difference]: Finished difference Result 707 states and 994 transitions. [2024-12-02 08:25:16,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-12-02 08:25:16,048 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2024-12-02 08:25:16,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:25:16,049 INFO L225 Difference]: With dead ends: 707 [2024-12-02 08:25:16,049 INFO L226 Difference]: Without dead ends: 380 [2024-12-02 08:25:16,049 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-12-02 08:25:16,050 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 394 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 980 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 980 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-12-02 08:25:16,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 884 Invalid, 982 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 980 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-12-02 08:25:16,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2024-12-02 08:25:16,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 359. [2024-12-02 08:25:16,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 358 states have (on average 1.4162011173184357) internal successors, (507), 358 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:16,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 507 transitions. [2024-12-02 08:25:16,054 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 507 transitions. Word has length 88 [2024-12-02 08:25:16,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:25:16,054 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 507 transitions. [2024-12-02 08:25:16,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:16,054 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 507 transitions. [2024-12-02 08:25:16,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-12-02 08:25:16,054 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:25:16,054 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 08:25:16,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-12-02 08:25:16,055 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 08:25:16,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:25:16,055 INFO L85 PathProgramCache]: Analyzing trace with hash -2103254133, now seen corresponding path program 1 times [2024-12-02 08:25:16,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:25:16,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509771622] [2024-12-02 08:25:16,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:25:16,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:25:16,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:25:16,506 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 08:25:16,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:25:16,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509771622] [2024-12-02 08:25:16,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509771622] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:25:16,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:25:16,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 08:25:16,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623906993] [2024-12-02 08:25:16,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:25:16,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 08:25:16,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:25:16,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 08:25:16,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-12-02 08:25:16,507 INFO L87 Difference]: Start difference. First operand 359 states and 507 transitions. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:16,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:25:16,977 INFO L93 Difference]: Finished difference Result 696 states and 981 transitions. [2024-12-02 08:25:16,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 08:25:16,978 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2024-12-02 08:25:16,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:25:16,979 INFO L225 Difference]: With dead ends: 696 [2024-12-02 08:25:16,979 INFO L226 Difference]: Without dead ends: 383 [2024-12-02 08:25:16,979 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-12-02 08:25:16,979 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 374 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 808 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-12-02 08:25:16,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 713 Invalid, 808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 808 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-12-02 08:25:16,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2024-12-02 08:25:16,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 381. [2024-12-02 08:25:16,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 380 states have (on average 1.4052631578947368) internal successors, (534), 380 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:16,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 534 transitions. [2024-12-02 08:25:16,983 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 534 transitions. Word has length 88 [2024-12-02 08:25:16,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:25:16,984 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 534 transitions. [2024-12-02 08:25:16,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:16,984 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 534 transitions. [2024-12-02 08:25:16,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-12-02 08:25:16,984 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:25:16,984 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 08:25:16,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-12-02 08:25:16,984 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 08:25:16,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:25:16,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1494297726, now seen corresponding path program 1 times [2024-12-02 08:25:16,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:25:16,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610607449] [2024-12-02 08:25:16,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:25:16,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:25:17,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:25:17,381 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 08:25:17,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:25:17,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610607449] [2024-12-02 08:25:17,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610607449] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:25:17,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:25:17,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 08:25:17,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538074098] [2024-12-02 08:25:17,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:25:17,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 08:25:17,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:25:17,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 08:25:17,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-12-02 08:25:17,382 INFO L87 Difference]: Start difference. First operand 381 states and 534 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:17,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:25:17,842 INFO L93 Difference]: Finished difference Result 770 states and 1075 transitions. [2024-12-02 08:25:17,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 08:25:17,842 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2024-12-02 08:25:17,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:25:17,843 INFO L225 Difference]: With dead ends: 770 [2024-12-02 08:25:17,843 INFO L226 Difference]: Without dead ends: 435 [2024-12-02 08:25:17,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-12-02 08:25:17,844 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 371 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 808 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-12-02 08:25:17,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 713 Invalid, 808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 808 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-12-02 08:25:17,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2024-12-02 08:25:17,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 397. [2024-12-02 08:25:17,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 396 states have (on average 1.4065656565656566) internal successors, (557), 396 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:17,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 557 transitions. [2024-12-02 08:25:17,847 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 557 transitions. Word has length 89 [2024-12-02 08:25:17,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:25:17,848 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 557 transitions. [2024-12-02 08:25:17,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:17,848 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 557 transitions. [2024-12-02 08:25:17,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-12-02 08:25:17,848 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:25:17,848 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 08:25:17,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-12-02 08:25:17,848 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 08:25:17,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:25:17,848 INFO L85 PathProgramCache]: Analyzing trace with hash -463996667, now seen corresponding path program 1 times [2024-12-02 08:25:17,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:25:17,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249853455] [2024-12-02 08:25:17,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:25:17,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:25:18,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:25:20,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 08:25:20,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:25:20,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249853455] [2024-12-02 08:25:20,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249853455] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:25:20,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:25:20,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-12-02 08:25:20,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498549927] [2024-12-02 08:25:20,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:25:20,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-12-02 08:25:20,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:25:20,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-12-02 08:25:20,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2024-12-02 08:25:20,905 INFO L87 Difference]: Start difference. First operand 397 states and 557 transitions. Second operand has 19 states, 19 states have (on average 4.684210526315789) internal successors, (89), 19 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:24,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:25:24,026 INFO L93 Difference]: Finished difference Result 1066 states and 1484 transitions. [2024-12-02 08:25:24,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-12-02 08:25:24,026 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.684210526315789) internal successors, (89), 19 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2024-12-02 08:25:24,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:25:24,027 INFO L225 Difference]: With dead ends: 1066 [2024-12-02 08:25:24,027 INFO L226 Difference]: Without dead ends: 715 [2024-12-02 08:25:24,028 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=175, Invalid=947, Unknown=0, NotChecked=0, Total=1122 [2024-12-02 08:25:24,028 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 1244 mSDsluCounter, 2627 mSDsCounter, 0 mSdLazyCounter, 4313 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1244 SdHoareTripleChecker+Valid, 2826 SdHoareTripleChecker+Invalid, 4316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-12-02 08:25:24,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1244 Valid, 2826 Invalid, 4316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4313 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-12-02 08:25:24,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2024-12-02 08:25:24,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 432. [2024-12-02 08:25:24,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 431 states have (on average 1.3990719257540603) internal successors, (603), 431 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:24,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 603 transitions. [2024-12-02 08:25:24,036 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 603 transitions. Word has length 89 [2024-12-02 08:25:24,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:25:24,036 INFO L471 AbstractCegarLoop]: Abstraction has 432 states and 603 transitions. [2024-12-02 08:25:24,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.684210526315789) internal successors, (89), 19 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:24,036 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 603 transitions. [2024-12-02 08:25:24,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-12-02 08:25:24,037 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:25:24,037 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 08:25:24,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-12-02 08:25:24,037 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 08:25:24,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:25:24,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1144624026, now seen corresponding path program 1 times [2024-12-02 08:25:24,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:25:24,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040993799] [2024-12-02 08:25:24,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:25:24,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:25:24,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:25:24,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 08:25:24,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:25:24,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040993799] [2024-12-02 08:25:24,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040993799] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:25:24,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:25:24,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-12-02 08:25:24,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136079629] [2024-12-02 08:25:24,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:25:24,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-12-02 08:25:24,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:25:24,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-12-02 08:25:24,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-12-02 08:25:24,472 INFO L87 Difference]: Start difference. First operand 432 states and 603 transitions. Second operand has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:25,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:25:25,202 INFO L93 Difference]: Finished difference Result 923 states and 1291 transitions. [2024-12-02 08:25:25,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-12-02 08:25:25,203 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2024-12-02 08:25:25,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:25:25,204 INFO L225 Difference]: With dead ends: 923 [2024-12-02 08:25:25,204 INFO L226 Difference]: Without dead ends: 537 [2024-12-02 08:25:25,204 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-12-02 08:25:25,204 INFO L435 NwaCegarLoop]: 245 mSDtfsCounter, 531 mSDsluCounter, 901 mSDsCounter, 0 mSdLazyCounter, 1287 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 531 SdHoareTripleChecker+Valid, 1146 SdHoareTripleChecker+Invalid, 1288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-12-02 08:25:25,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [531 Valid, 1146 Invalid, 1288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1287 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-12-02 08:25:25,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2024-12-02 08:25:25,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 436. [2024-12-02 08:25:25,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 435 states have (on average 1.3954022988505748) internal successors, (607), 435 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:25,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 607 transitions. [2024-12-02 08:25:25,209 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 607 transitions. Word has length 90 [2024-12-02 08:25:25,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:25:25,209 INFO L471 AbstractCegarLoop]: Abstraction has 436 states and 607 transitions. [2024-12-02 08:25:25,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:25,209 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 607 transitions. [2024-12-02 08:25:25,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-12-02 08:25:25,209 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:25:25,210 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 08:25:25,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-12-02 08:25:25,210 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 08:25:25,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:25:25,210 INFO L85 PathProgramCache]: Analyzing trace with hash -112633779, now seen corresponding path program 1 times [2024-12-02 08:25:25,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:25:25,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766771771] [2024-12-02 08:25:25,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:25:25,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:25:25,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:25:25,592 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 08:25:25,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:25:25,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766771771] [2024-12-02 08:25:25,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766771771] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:25:25,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:25:25,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-12-02 08:25:25,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943530369] [2024-12-02 08:25:25,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:25:25,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-12-02 08:25:25,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:25:25,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-12-02 08:25:25,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-12-02 08:25:25,594 INFO L87 Difference]: Start difference. First operand 436 states and 607 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:26,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:25:26,437 INFO L93 Difference]: Finished difference Result 948 states and 1322 transitions. [2024-12-02 08:25:26,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-12-02 08:25:26,438 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2024-12-02 08:25:26,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:25:26,439 INFO L225 Difference]: With dead ends: 948 [2024-12-02 08:25:26,439 INFO L226 Difference]: Without dead ends: 558 [2024-12-02 08:25:26,439 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-12-02 08:25:26,439 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 533 mSDsluCounter, 906 mSDsCounter, 0 mSdLazyCounter, 1318 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 1154 SdHoareTripleChecker+Invalid, 1318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-12-02 08:25:26,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [533 Valid, 1154 Invalid, 1318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1318 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-12-02 08:25:26,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2024-12-02 08:25:26,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 446. [2024-12-02 08:25:26,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 445 states have (on average 1.3887640449438203) internal successors, (618), 445 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:26,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 618 transitions. [2024-12-02 08:25:26,444 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 618 transitions. Word has length 90 [2024-12-02 08:25:26,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:25:26,444 INFO L471 AbstractCegarLoop]: Abstraction has 446 states and 618 transitions. [2024-12-02 08:25:26,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:26,444 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 618 transitions. [2024-12-02 08:25:26,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-12-02 08:25:26,445 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:25:26,445 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 08:25:26,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-12-02 08:25:26,445 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 08:25:26,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:25:26,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1233782766, now seen corresponding path program 1 times [2024-12-02 08:25:26,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:25:26,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006190042] [2024-12-02 08:25:26,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:25:26,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:25:26,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:25:27,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 08:25:27,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:25:27,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006190042] [2024-12-02 08:25:27,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006190042] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:25:27,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:25:27,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-12-02 08:25:27,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159225096] [2024-12-02 08:25:27,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:25:27,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-12-02 08:25:27,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:25:27,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-12-02 08:25:27,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-12-02 08:25:27,119 INFO L87 Difference]: Start difference. First operand 446 states and 618 transitions. Second operand has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:28,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:25:28,043 INFO L93 Difference]: Finished difference Result 830 states and 1149 transitions. [2024-12-02 08:25:28,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-12-02 08:25:28,043 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2024-12-02 08:25:28,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:25:28,044 INFO L225 Difference]: With dead ends: 830 [2024-12-02 08:25:28,044 INFO L226 Difference]: Without dead ends: 430 [2024-12-02 08:25:28,044 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2024-12-02 08:25:28,044 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 379 mSDsluCounter, 886 mSDsCounter, 0 mSdLazyCounter, 1252 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 1069 SdHoareTripleChecker+Invalid, 1254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-12-02 08:25:28,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 1069 Invalid, 1254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1252 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-12-02 08:25:28,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2024-12-02 08:25:28,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 430. [2024-12-02 08:25:28,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 429 states have (on average 1.3822843822843822) internal successors, (593), 429 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:28,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 593 transitions. [2024-12-02 08:25:28,050 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 593 transitions. Word has length 90 [2024-12-02 08:25:28,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:25:28,050 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 593 transitions. [2024-12-02 08:25:28,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:28,050 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 593 transitions. [2024-12-02 08:25:28,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-12-02 08:25:28,051 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:25:28,051 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 08:25:28,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-12-02 08:25:28,051 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 08:25:28,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:25:28,051 INFO L85 PathProgramCache]: Analyzing trace with hash -411987638, now seen corresponding path program 1 times [2024-12-02 08:25:28,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:25:28,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702304404] [2024-12-02 08:25:28,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:25:28,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:25:28,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:25:28,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 08:25:28,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:25:28,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702304404] [2024-12-02 08:25:28,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702304404] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:25:28,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:25:28,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 08:25:28,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409874836] [2024-12-02 08:25:28,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:25:28,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 08:25:28,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:25:28,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 08:25:28,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-12-02 08:25:28,391 INFO L87 Difference]: Start difference. First operand 430 states and 593 transitions. Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:28,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:25:28,828 INFO L93 Difference]: Finished difference Result 870 states and 1194 transitions. [2024-12-02 08:25:28,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 08:25:28,828 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2024-12-02 08:25:28,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:25:28,829 INFO L225 Difference]: With dead ends: 870 [2024-12-02 08:25:28,829 INFO L226 Difference]: Without dead ends: 486 [2024-12-02 08:25:28,829 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-12-02 08:25:28,830 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 362 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 790 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-12-02 08:25:28,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 713 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 790 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-12-02 08:25:28,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2024-12-02 08:25:28,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 440. [2024-12-02 08:25:28,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 439 states have (on average 1.3826879271070616) internal successors, (607), 439 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:28,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 607 transitions. [2024-12-02 08:25:28,834 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 607 transitions. Word has length 90 [2024-12-02 08:25:28,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:25:28,834 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 607 transitions. [2024-12-02 08:25:28,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:28,834 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 607 transitions. [2024-12-02 08:25:28,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-12-02 08:25:28,834 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:25:28,834 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 08:25:28,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-12-02 08:25:28,834 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 08:25:28,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:25:28,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1883983552, now seen corresponding path program 1 times [2024-12-02 08:25:28,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:25:28,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529663384] [2024-12-02 08:25:28,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:25:28,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:25:29,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:25:29,361 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 08:25:29,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:25:29,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529663384] [2024-12-02 08:25:29,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529663384] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:25:29,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:25:29,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 08:25:29,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70846930] [2024-12-02 08:25:29,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:25:29,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 08:25:29,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:25:29,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 08:25:29,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-12-02 08:25:29,362 INFO L87 Difference]: Start difference. First operand 440 states and 607 transitions. Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:29,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:25:29,935 INFO L93 Difference]: Finished difference Result 942 states and 1302 transitions. [2024-12-02 08:25:29,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 08:25:29,935 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2024-12-02 08:25:29,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:25:29,936 INFO L225 Difference]: With dead ends: 942 [2024-12-02 08:25:29,936 INFO L226 Difference]: Without dead ends: 548 [2024-12-02 08:25:29,937 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-12-02 08:25:29,937 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 509 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 961 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-12-02 08:25:29,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 884 Invalid, 961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 961 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-12-02 08:25:29,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2024-12-02 08:25:29,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 467. [2024-12-02 08:25:29,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 466 states have (on average 1.3798283261802575) internal successors, (643), 466 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:29,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 643 transitions. [2024-12-02 08:25:29,941 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 643 transitions. Word has length 90 [2024-12-02 08:25:29,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:25:29,941 INFO L471 AbstractCegarLoop]: Abstraction has 467 states and 643 transitions. [2024-12-02 08:25:29,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:29,942 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 643 transitions. [2024-12-02 08:25:29,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-12-02 08:25:29,942 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:25:29,942 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:25:29,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-12-02 08:25:29,942 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 08:25:29,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:25:29,942 INFO L85 PathProgramCache]: Analyzing trace with hash 921450183, now seen corresponding path program 1 times [2024-12-02 08:25:29,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:25:29,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364930379] [2024-12-02 08:25:29,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:25:29,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:25:30,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:25:30,384 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 08:25:30,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:25:30,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364930379] [2024-12-02 08:25:30,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364930379] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:25:30,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:25:30,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 08:25:30,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145988281] [2024-12-02 08:25:30,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:25:30,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 08:25:30,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:25:30,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 08:25:30,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-12-02 08:25:30,385 INFO L87 Difference]: Start difference. First operand 467 states and 643 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:30,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:25:30,749 INFO L93 Difference]: Finished difference Result 896 states and 1233 transitions. [2024-12-02 08:25:30,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 08:25:30,749 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2024-12-02 08:25:30,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:25:30,751 INFO L225 Difference]: With dead ends: 896 [2024-12-02 08:25:30,752 INFO L226 Difference]: Without dead ends: 475 [2024-12-02 08:25:30,752 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-12-02 08:25:30,752 INFO L435 NwaCegarLoop]: 340 mSDtfsCounter, 11 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 1030 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-12-02 08:25:30,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 1030 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-12-02 08:25:30,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2024-12-02 08:25:30,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 457. [2024-12-02 08:25:30,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 456 states have (on average 1.3837719298245614) internal successors, (631), 456 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:30,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 631 transitions. [2024-12-02 08:25:30,757 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 631 transitions. Word has length 91 [2024-12-02 08:25:30,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:25:30,757 INFO L471 AbstractCegarLoop]: Abstraction has 457 states and 631 transitions. [2024-12-02 08:25:30,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:30,757 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 631 transitions. [2024-12-02 08:25:30,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-12-02 08:25:30,758 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:25:30,758 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 08:25:30,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-12-02 08:25:30,758 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 08:25:30,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:25:30,758 INFO L85 PathProgramCache]: Analyzing trace with hash 425657126, now seen corresponding path program 1 times [2024-12-02 08:25:30,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:25:30,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236390412] [2024-12-02 08:25:30,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:25:30,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:25:31,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:25:33,517 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 08:25:33,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:25:33,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236390412] [2024-12-02 08:25:33,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236390412] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:25:33,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:25:33,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-12-02 08:25:33,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628857876] [2024-12-02 08:25:33,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:25:33,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-12-02 08:25:33,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:25:33,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-12-02 08:25:33,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2024-12-02 08:25:33,518 INFO L87 Difference]: Start difference. First operand 457 states and 631 transitions. Second operand has 16 states, 16 states have (on average 5.6875) internal successors, (91), 16 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:35,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:25:35,971 INFO L93 Difference]: Finished difference Result 1057 states and 1454 transitions. [2024-12-02 08:25:35,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-12-02 08:25:35,972 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.6875) internal successors, (91), 16 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2024-12-02 08:25:35,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:25:35,973 INFO L225 Difference]: With dead ends: 1057 [2024-12-02 08:25:35,973 INFO L226 Difference]: Without dead ends: 646 [2024-12-02 08:25:35,974 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=125, Invalid=631, Unknown=0, NotChecked=0, Total=756 [2024-12-02 08:25:35,975 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 891 mSDsluCounter, 1866 mSDsCounter, 0 mSdLazyCounter, 2980 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 891 SdHoareTripleChecker+Valid, 2023 SdHoareTripleChecker+Invalid, 2983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2980 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-12-02 08:25:35,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [891 Valid, 2023 Invalid, 2983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2980 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-12-02 08:25:35,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2024-12-02 08:25:35,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 441. [2024-12-02 08:25:35,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 440 states have (on average 1.3795454545454546) internal successors, (607), 440 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:35,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 607 transitions. [2024-12-02 08:25:35,982 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 607 transitions. Word has length 91 [2024-12-02 08:25:35,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:25:35,982 INFO L471 AbstractCegarLoop]: Abstraction has 441 states and 607 transitions. [2024-12-02 08:25:35,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.6875) internal successors, (91), 16 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:35,983 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 607 transitions. [2024-12-02 08:25:35,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-12-02 08:25:35,983 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:25:35,983 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 08:25:35,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-12-02 08:25:35,984 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 08:25:35,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:25:35,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1187443383, now seen corresponding path program 1 times [2024-12-02 08:25:35,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:25:35,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670092312] [2024-12-02 08:25:35,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:25:35,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:25:36,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:25:36,726 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 08:25:36,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:25:36,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670092312] [2024-12-02 08:25:36,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670092312] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:25:36,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:25:36,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-12-02 08:25:36,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356020178] [2024-12-02 08:25:36,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:25:36,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-12-02 08:25:36,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:25:36,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-12-02 08:25:36,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-12-02 08:25:36,727 INFO L87 Difference]: Start difference. First operand 441 states and 607 transitions. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 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 08:25:37,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:25:37,267 INFO L93 Difference]: Finished difference Result 836 states and 1150 transitions. [2024-12-02 08:25:37,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-12-02 08:25:37,268 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 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 08:25:37,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:25:37,268 INFO L225 Difference]: With dead ends: 836 [2024-12-02 08:25:37,268 INFO L226 Difference]: Without dead ends: 441 [2024-12-02 08:25:37,269 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2024-12-02 08:25:37,269 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 380 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-12-02 08:25:37,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 709 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 782 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-12-02 08:25:37,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2024-12-02 08:25:37,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 441. [2024-12-02 08:25:37,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 440 states have (on average 1.375) internal successors, (605), 440 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:37,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 605 transitions. [2024-12-02 08:25:37,273 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 605 transitions. Word has length 92 [2024-12-02 08:25:37,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:25:37,273 INFO L471 AbstractCegarLoop]: Abstraction has 441 states and 605 transitions. [2024-12-02 08:25:37,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 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 08:25:37,273 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 605 transitions. [2024-12-02 08:25:37,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-12-02 08:25:37,273 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:25:37,273 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 08:25:37,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-12-02 08:25:37,274 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 08:25:37,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:25:37,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1954698773, now seen corresponding path program 1 times [2024-12-02 08:25:37,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:25:37,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300759698] [2024-12-02 08:25:37,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:25:37,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:25:37,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:25:38,200 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 08:25:38,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:25:38,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300759698] [2024-12-02 08:25:38,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300759698] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:25:38,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:25:38,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-12-02 08:25:38,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807658095] [2024-12-02 08:25:38,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:25:38,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-12-02 08:25:38,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:25:38,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-12-02 08:25:38,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-12-02 08:25:38,201 INFO L87 Difference]: Start difference. First operand 441 states and 605 transitions. Second operand has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 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 08:25:39,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:25:39,285 INFO L93 Difference]: Finished difference Result 937 states and 1288 transitions. [2024-12-02 08:25:39,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-12-02 08:25:39,285 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 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 08:25:39,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:25:39,286 INFO L225 Difference]: With dead ends: 937 [2024-12-02 08:25:39,286 INFO L226 Difference]: Without dead ends: 542 [2024-12-02 08:25:39,286 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2024-12-02 08:25:39,286 INFO L435 NwaCegarLoop]: 241 mSDtfsCounter, 525 mSDsluCounter, 1361 mSDsCounter, 0 mSdLazyCounter, 1770 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 1602 SdHoareTripleChecker+Invalid, 1771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-12-02 08:25:39,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 1602 Invalid, 1771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1770 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-12-02 08:25:39,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2024-12-02 08:25:39,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 449. [2024-12-02 08:25:39,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 448 states have (on average 1.3683035714285714) internal successors, (613), 448 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:39,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 613 transitions. [2024-12-02 08:25:39,291 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 613 transitions. Word has length 93 [2024-12-02 08:25:39,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:25:39,291 INFO L471 AbstractCegarLoop]: Abstraction has 449 states and 613 transitions. [2024-12-02 08:25:39,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 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 08:25:39,291 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 613 transitions. [2024-12-02 08:25:39,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-12-02 08:25:39,292 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:25:39,292 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 08:25:39,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-12-02 08:25:39,292 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 08:25:39,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:25:39,292 INFO L85 PathProgramCache]: Analyzing trace with hash -2082921821, now seen corresponding path program 1 times [2024-12-02 08:25:39,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:25:39,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101012989] [2024-12-02 08:25:39,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:25:39,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:25:39,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:25:39,637 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 08:25:39,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:25:39,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101012989] [2024-12-02 08:25:39,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101012989] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:25:39,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:25:39,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-12-02 08:25:39,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712979514] [2024-12-02 08:25:39,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:25:39,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-12-02 08:25:39,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:25:39,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-12-02 08:25:39,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-12-02 08:25:39,638 INFO L87 Difference]: Start difference. First operand 449 states and 613 transitions. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 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 08:25:40,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:25:40,527 INFO L93 Difference]: Finished difference Result 968 states and 1324 transitions. [2024-12-02 08:25:40,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-12-02 08:25:40,527 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 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 08:25:40,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:25:40,528 INFO L225 Difference]: With dead ends: 968 [2024-12-02 08:25:40,528 INFO L226 Difference]: Without dead ends: 565 [2024-12-02 08:25:40,529 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-12-02 08:25:40,529 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 526 mSDsluCounter, 906 mSDsCounter, 0 mSdLazyCounter, 1308 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 1154 SdHoareTripleChecker+Invalid, 1308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-12-02 08:25:40,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 1154 Invalid, 1308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1308 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-12-02 08:25:40,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2024-12-02 08:25:40,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 457. [2024-12-02 08:25:40,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 456 states have (on average 1.3640350877192982) internal successors, (622), 456 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:40,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 622 transitions. [2024-12-02 08:25:40,534 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 622 transitions. Word has length 93 [2024-12-02 08:25:40,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:25:40,534 INFO L471 AbstractCegarLoop]: Abstraction has 457 states and 622 transitions. [2024-12-02 08:25:40,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 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 08:25:40,534 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 622 transitions. [2024-12-02 08:25:40,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-12-02 08:25:40,534 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:25:40,534 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 08:25:40,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-12-02 08:25:40,535 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 08:25:40,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:25:40,535 INFO L85 PathProgramCache]: Analyzing trace with hash 320337447, now seen corresponding path program 1 times [2024-12-02 08:25:40,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:25:40,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557469046] [2024-12-02 08:25:40,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:25:40,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:25:40,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:25:41,073 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 08:25:41,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:25:41,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557469046] [2024-12-02 08:25:41,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557469046] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:25:41,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:25:41,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 08:25:41,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427354872] [2024-12-02 08:25:41,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:25:41,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 08:25:41,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:25:41,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 08:25:41,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-12-02 08:25:41,075 INFO L87 Difference]: Start difference. First operand 457 states and 622 transitions. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 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 08:25:41,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:25:41,505 INFO L93 Difference]: Finished difference Result 896 states and 1217 transitions. [2024-12-02 08:25:41,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 08:25:41,505 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 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 08:25:41,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:25:41,506 INFO L225 Difference]: With dead ends: 896 [2024-12-02 08:25:41,506 INFO L226 Difference]: Without dead ends: 465 [2024-12-02 08:25:41,506 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-12-02 08:25:41,507 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 331 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 800 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-12-02 08:25:41,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 719 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 800 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-12-02 08:25:41,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2024-12-02 08:25:41,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 464. [2024-12-02 08:25:41,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 463 states have (on average 1.3542116630669547) internal successors, (627), 463 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:41,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 627 transitions. [2024-12-02 08:25:41,511 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 627 transitions. Word has length 93 [2024-12-02 08:25:41,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:25:41,511 INFO L471 AbstractCegarLoop]: Abstraction has 464 states and 627 transitions. [2024-12-02 08:25:41,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 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 08:25:41,511 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 627 transitions. [2024-12-02 08:25:41,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-12-02 08:25:41,511 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:25:41,511 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 08:25:41,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-12-02 08:25:41,512 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 08:25:41,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:25:41,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1885156008, now seen corresponding path program 1 times [2024-12-02 08:25:41,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:25:41,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834123800] [2024-12-02 08:25:41,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:25:41,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:25:41,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:25:43,379 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 08:25:43,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:25:43,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834123800] [2024-12-02 08:25:43,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834123800] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:25:43,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:25:43,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-12-02 08:25:43,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240483016] [2024-12-02 08:25:43,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:25:43,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-12-02 08:25:43,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:25:43,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-12-02 08:25:43,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-12-02 08:25:43,381 INFO L87 Difference]: Start difference. First operand 464 states and 627 transitions. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:44,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:25:44,089 INFO L93 Difference]: Finished difference Result 1024 states and 1383 transitions. [2024-12-02 08:25:44,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-12-02 08:25:44,090 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2024-12-02 08:25:44,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:25:44,091 INFO L225 Difference]: With dead ends: 1024 [2024-12-02 08:25:44,091 INFO L226 Difference]: Without dead ends: 606 [2024-12-02 08:25:44,091 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-12-02 08:25:44,091 INFO L435 NwaCegarLoop]: 386 mSDtfsCounter, 577 mSDsluCounter, 1697 mSDsCounter, 0 mSdLazyCounter, 972 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 577 SdHoareTripleChecker+Valid, 2083 SdHoareTripleChecker+Invalid, 972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 972 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-12-02 08:25:44,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [577 Valid, 2083 Invalid, 972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 972 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-12-02 08:25:44,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2024-12-02 08:25:44,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 522. [2024-12-02 08:25:44,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 521 states have (on average 1.3416506717850287) internal successors, (699), 521 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:44,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 699 transitions. [2024-12-02 08:25:44,098 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 699 transitions. Word has length 94 [2024-12-02 08:25:44,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:25:44,098 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 699 transitions. [2024-12-02 08:25:44,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:44,099 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 699 transitions. [2024-12-02 08:25:44,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-12-02 08:25:44,099 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:25:44,099 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 08:25:44,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-12-02 08:25:44,099 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 08:25:44,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:25:44,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1900762674, now seen corresponding path program 1 times [2024-12-02 08:25:44,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:25:44,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493672717] [2024-12-02 08:25:44,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:25:44,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:25:44,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:25:45,885 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 08:25:45,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:25:45,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493672717] [2024-12-02 08:25:45,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493672717] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:25:45,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:25:45,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-12-02 08:25:45,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853638594] [2024-12-02 08:25:45,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:25:45,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-12-02 08:25:45,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:25:45,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-12-02 08:25:45,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-12-02 08:25:45,886 INFO L87 Difference]: Start difference. First operand 522 states and 699 transitions. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:46,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:25:46,638 INFO L93 Difference]: Finished difference Result 1014 states and 1359 transitions. [2024-12-02 08:25:46,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-12-02 08:25:46,638 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2024-12-02 08:25:46,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:25:46,639 INFO L225 Difference]: With dead ends: 1014 [2024-12-02 08:25:46,639 INFO L226 Difference]: Without dead ends: 538 [2024-12-02 08:25:46,640 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-12-02 08:25:46,640 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 456 mSDsluCounter, 865 mSDsCounter, 0 mSdLazyCounter, 1236 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 1039 SdHoareTripleChecker+Invalid, 1237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-12-02 08:25:46,640 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 1039 Invalid, 1237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1236 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-12-02 08:25:46,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2024-12-02 08:25:46,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 537. [2024-12-02 08:25:46,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 536 states have (on average 1.337686567164179) internal successors, (717), 536 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:46,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 717 transitions. [2024-12-02 08:25:46,647 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 717 transitions. Word has length 94 [2024-12-02 08:25:46,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:25:46,647 INFO L471 AbstractCegarLoop]: Abstraction has 537 states and 717 transitions. [2024-12-02 08:25:46,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:46,647 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 717 transitions. [2024-12-02 08:25:46,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-12-02 08:25:46,648 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:25:46,648 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 08:25:46,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-12-02 08:25:46,648 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 08:25:46,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:25:46,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1681378003, now seen corresponding path program 1 times [2024-12-02 08:25:46,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:25:46,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337599051] [2024-12-02 08:25:46,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:25:46,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:25:46,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:25:48,342 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 08:25:48,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:25:48,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337599051] [2024-12-02 08:25:48,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337599051] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:25:48,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:25:48,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-12-02 08:25:48,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405916055] [2024-12-02 08:25:48,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:25:48,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-12-02 08:25:48,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:25:48,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-12-02 08:25:48,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-12-02 08:25:48,343 INFO L87 Difference]: Start difference. First operand 537 states and 717 transitions. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:49,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:25:49,080 INFO L93 Difference]: Finished difference Result 928 states and 1241 transitions. [2024-12-02 08:25:49,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-12-02 08:25:49,080 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2024-12-02 08:25:49,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:25:49,081 INFO L225 Difference]: With dead ends: 928 [2024-12-02 08:25:49,081 INFO L226 Difference]: Without dead ends: 437 [2024-12-02 08:25:49,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-12-02 08:25:49,082 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 497 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 655 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-12-02 08:25:49,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [497 Valid, 632 Invalid, 657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 655 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-12-02 08:25:49,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2024-12-02 08:25:49,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 404. [2024-12-02 08:25:49,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 403 states have (on average 1.3548387096774193) internal successors, (546), 403 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:49,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 546 transitions. [2024-12-02 08:25:49,087 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 546 transitions. Word has length 94 [2024-12-02 08:25:49,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:25:49,087 INFO L471 AbstractCegarLoop]: Abstraction has 404 states and 546 transitions. [2024-12-02 08:25:49,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:49,088 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 546 transitions. [2024-12-02 08:25:49,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-12-02 08:25:49,088 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:25:49,088 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:25:49,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-12-02 08:25:49,088 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 08:25:49,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:25:49,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1463719144, now seen corresponding path program 1 times [2024-12-02 08:25:49,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:25:49,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307077292] [2024-12-02 08:25:49,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:25:49,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:25:49,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:25:51,640 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 08:25:51,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:25:51,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307077292] [2024-12-02 08:25:51,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307077292] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:25:51,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:25:51,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-12-02 08:25:51,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527390711] [2024-12-02 08:25:51,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:25:51,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-12-02 08:25:51,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:25:51,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-12-02 08:25:51,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2024-12-02 08:25:51,641 INFO L87 Difference]: Start difference. First operand 404 states and 546 transitions. Second operand has 16 states, 16 states have (on average 5.9375) internal successors, (95), 16 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:53,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:25:53,822 INFO L93 Difference]: Finished difference Result 978 states and 1310 transitions. [2024-12-02 08:25:53,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-12-02 08:25:53,822 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.9375) internal successors, (95), 16 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2024-12-02 08:25:53,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:25:53,823 INFO L225 Difference]: With dead ends: 978 [2024-12-02 08:25:53,824 INFO L226 Difference]: Without dead ends: 620 [2024-12-02 08:25:53,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=111, Invalid=591, Unknown=0, NotChecked=0, Total=702 [2024-12-02 08:25:53,824 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 810 mSDsluCounter, 1877 mSDsCounter, 0 mSdLazyCounter, 2693 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 810 SdHoareTripleChecker+Valid, 2039 SdHoareTripleChecker+Invalid, 2695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-12-02 08:25:53,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [810 Valid, 2039 Invalid, 2695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 2693 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-12-02 08:25:53,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2024-12-02 08:25:53,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 441. [2024-12-02 08:25:53,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 440 states have (on average 1.3522727272727273) internal successors, (595), 440 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:53,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 595 transitions. [2024-12-02 08:25:53,828 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 595 transitions. Word has length 95 [2024-12-02 08:25:53,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:25:53,828 INFO L471 AbstractCegarLoop]: Abstraction has 441 states and 595 transitions. [2024-12-02 08:25:53,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.9375) internal successors, (95), 16 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:53,829 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 595 transitions. [2024-12-02 08:25:53,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-12-02 08:25:53,829 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:25:53,829 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 08:25:53,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-12-02 08:25:53,829 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 08:25:53,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:25:53,829 INFO L85 PathProgramCache]: Analyzing trace with hash 481929035, now seen corresponding path program 1 times [2024-12-02 08:25:53,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:25:53,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313310515] [2024-12-02 08:25:53,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:25:53,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:25:54,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:25:54,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 08:25:54,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:25:54,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313310515] [2024-12-02 08:25:54,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313310515] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:25:54,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:25:54,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-12-02 08:25:54,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541648404] [2024-12-02 08:25:54,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:25:54,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-12-02 08:25:54,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:25:54,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-12-02 08:25:54,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-12-02 08:25:54,552 INFO L87 Difference]: Start difference. First operand 441 states and 595 transitions. Second operand has 8 states, 8 states have (on average 12.0) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:54,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:25:54,640 INFO L93 Difference]: Finished difference Result 993 states and 1339 transitions. [2024-12-02 08:25:54,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-12-02 08:25:54,641 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2024-12-02 08:25:54,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:25:54,642 INFO L225 Difference]: With dead ends: 993 [2024-12-02 08:25:54,642 INFO L226 Difference]: Without dead ends: 598 [2024-12-02 08:25:54,643 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-12-02 08:25:54,643 INFO L435 NwaCegarLoop]: 348 mSDtfsCounter, 186 mSDsluCounter, 1729 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 2077 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 08:25:54,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 2077 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 08:25:54,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2024-12-02 08:25:54,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 519. [2024-12-02 08:25:54,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 518 states have (on average 1.3416988416988418) internal successors, (695), 518 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:54,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 695 transitions. [2024-12-02 08:25:54,651 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 695 transitions. Word has length 96 [2024-12-02 08:25:54,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:25:54,651 INFO L471 AbstractCegarLoop]: Abstraction has 519 states and 695 transitions. [2024-12-02 08:25:54,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:54,651 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 695 transitions. [2024-12-02 08:25:54,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-12-02 08:25:54,652 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:25:54,652 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 08:25:54,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-12-02 08:25:54,652 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 08:25:54,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:25:54,652 INFO L85 PathProgramCache]: Analyzing trace with hash -173729265, now seen corresponding path program 1 times [2024-12-02 08:25:54,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:25:54,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267724581] [2024-12-02 08:25:54,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:25:54,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:25:54,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:25:54,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 08:25:54,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:25:54,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267724581] [2024-12-02 08:25:54,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267724581] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:25:54,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:25:54,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 08:25:54,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76057690] [2024-12-02 08:25:54,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:25:54,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 08:25:54,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:25:54,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 08:25:54,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-12-02 08:25:54,972 INFO L87 Difference]: Start difference. First operand 519 states and 695 transitions. Second operand has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:55,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:25:55,002 INFO L93 Difference]: Finished difference Result 952 states and 1282 transitions. [2024-12-02 08:25:55,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 08:25:55,002 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2024-12-02 08:25:55,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:25:55,004 INFO L225 Difference]: With dead ends: 952 [2024-12-02 08:25:55,005 INFO L226 Difference]: Without dead ends: 557 [2024-12-02 08:25:55,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-12-02 08:25:55,005 INFO L435 NwaCegarLoop]: 357 mSDtfsCounter, 35 mSDsluCounter, 1062 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 1419 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 08:25:55,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 1419 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 08:25:55,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2024-12-02 08:25:55,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 556. [2024-12-02 08:25:55,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 555 states have (on average 1.3495495495495495) internal successors, (749), 555 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:55,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 749 transitions. [2024-12-02 08:25:55,010 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 749 transitions. Word has length 96 [2024-12-02 08:25:55,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:25:55,010 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 749 transitions. [2024-12-02 08:25:55,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:55,010 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 749 transitions. [2024-12-02 08:25:55,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-12-02 08:25:55,010 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:25:55,010 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 08:25:55,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-12-02 08:25:55,010 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 08:25:55,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:25:55,011 INFO L85 PathProgramCache]: Analyzing trace with hash -771293165, now seen corresponding path program 1 times [2024-12-02 08:25:55,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:25:55,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773422924] [2024-12-02 08:25:55,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:25:55,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:25:55,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:25:55,495 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 08:25:55,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:25:55,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773422924] [2024-12-02 08:25:55,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773422924] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:25:55,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:25:55,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-12-02 08:25:55,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722234189] [2024-12-02 08:25:55,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:25:55,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-12-02 08:25:55,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:25:55,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-12-02 08:25:55,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-12-02 08:25:55,496 INFO L87 Difference]: Start difference. First operand 556 states and 749 transitions. Second operand has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:55,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:25:55,530 INFO L93 Difference]: Finished difference Result 986 states and 1332 transitions. [2024-12-02 08:25:55,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 08:25:55,531 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2024-12-02 08:25:55,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:25:55,532 INFO L225 Difference]: With dead ends: 986 [2024-12-02 08:25:55,532 INFO L226 Difference]: Without dead ends: 554 [2024-12-02 08:25:55,532 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-12-02 08:25:55,532 INFO L435 NwaCegarLoop]: 352 mSDtfsCounter, 274 mSDsluCounter, 1051 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 1403 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 08:25:55,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 1403 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 08:25:55,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2024-12-02 08:25:55,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 551. [2024-12-02 08:25:55,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 550 states have (on average 1.3490909090909091) internal successors, (742), 550 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:55,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 742 transitions. [2024-12-02 08:25:55,537 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 742 transitions. Word has length 97 [2024-12-02 08:25:55,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:25:55,537 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 742 transitions. [2024-12-02 08:25:55,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:55,537 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 742 transitions. [2024-12-02 08:25:55,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-12-02 08:25:55,538 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:25:55,538 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 08:25:55,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-12-02 08:25:55,538 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 08:25:55,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:25:55,538 INFO L85 PathProgramCache]: Analyzing trace with hash 679212043, now seen corresponding path program 1 times [2024-12-02 08:25:55,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:25:55,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827039345] [2024-12-02 08:25:55,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:25:55,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:25:55,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:25:58,499 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 08:25:58,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:25:58,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827039345] [2024-12-02 08:25:58,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827039345] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:25:58,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:25:58,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-12-02 08:25:58,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399180901] [2024-12-02 08:25:58,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:25:58,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-12-02 08:25:58,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:25:58,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-12-02 08:25:58,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-12-02 08:25:58,501 INFO L87 Difference]: Start difference. First operand 551 states and 742 transitions. Second operand has 13 states, 13 states have (on average 7.461538461538462) internal successors, (97), 13 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:26:00,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:26:00,099 INFO L93 Difference]: Finished difference Result 1239 states and 1703 transitions. [2024-12-02 08:26:00,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-12-02 08:26:00,099 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.461538461538462) internal successors, (97), 13 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2024-12-02 08:26:00,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:26:00,101 INFO L225 Difference]: With dead ends: 1239 [2024-12-02 08:26:00,101 INFO L226 Difference]: Without dead ends: 812 [2024-12-02 08:26:00,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2024-12-02 08:26:00,102 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 495 mSDsluCounter, 1685 mSDsCounter, 0 mSdLazyCounter, 2386 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 1897 SdHoareTripleChecker+Invalid, 2387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-12-02 08:26:00,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [495 Valid, 1897 Invalid, 2387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2386 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-12-02 08:26:00,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2024-12-02 08:26:00,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 597. [2024-12-02 08:26:00,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 596 states have (on average 1.3590604026845639) internal successors, (810), 596 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:26:00,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 810 transitions. [2024-12-02 08:26:00,110 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 810 transitions. Word has length 97 [2024-12-02 08:26:00,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:26:00,110 INFO L471 AbstractCegarLoop]: Abstraction has 597 states and 810 transitions. [2024-12-02 08:26:00,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.461538461538462) internal successors, (97), 13 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:26:00,111 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 810 transitions. [2024-12-02 08:26:00,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-12-02 08:26:00,111 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:26:00,111 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 08:26:00,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-12-02 08:26:00,111 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 08:26:00,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:26:00,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1012386861, now seen corresponding path program 1 times [2024-12-02 08:26:00,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:26:00,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683688943] [2024-12-02 08:26:00,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:26:00,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:26:00,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:26:01,074 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 08:26:01,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:26:01,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683688943] [2024-12-02 08:26:01,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683688943] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:26:01,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:26:01,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-12-02 08:26:01,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101020358] [2024-12-02 08:26:01,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:26:01,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-12-02 08:26:01,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:26:01,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-12-02 08:26:01,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-12-02 08:26:01,076 INFO L87 Difference]: Start difference. First operand 597 states and 810 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:26:01,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:26:01,165 INFO L93 Difference]: Finished difference Result 1095 states and 1488 transitions. [2024-12-02 08:26:01,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-12-02 08:26:01,166 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2024-12-02 08:26:01,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:26:01,167 INFO L225 Difference]: With dead ends: 1095 [2024-12-02 08:26:01,167 INFO L226 Difference]: Without dead ends: 668 [2024-12-02 08:26:01,167 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-12-02 08:26:01,167 INFO L435 NwaCegarLoop]: 341 mSDtfsCounter, 135 mSDsluCounter, 1942 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 2283 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 08:26:01,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 2283 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 08:26:01,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2024-12-02 08:26:01,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 623. [2024-12-02 08:26:01,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 622 states have (on average 1.3633440514469453) internal successors, (848), 622 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:26:01,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 848 transitions. [2024-12-02 08:26:01,172 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 848 transitions. Word has length 97 [2024-12-02 08:26:01,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:26:01,173 INFO L471 AbstractCegarLoop]: Abstraction has 623 states and 848 transitions. [2024-12-02 08:26:01,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:26:01,173 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 848 transitions. [2024-12-02 08:26:01,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-12-02 08:26:01,173 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:26:01,173 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:26:01,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-12-02 08:26:01,173 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 08:26:01,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:26:01,174 INFO L85 PathProgramCache]: Analyzing trace with hash -870706066, now seen corresponding path program 1 times [2024-12-02 08:26:01,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:26:01,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833823765] [2024-12-02 08:26:01,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:26:01,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:26:01,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:26:02,063 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 08:26:02,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:26:02,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833823765] [2024-12-02 08:26:02,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833823765] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:26:02,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:26:02,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-12-02 08:26:02,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315109424] [2024-12-02 08:26:02,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:26:02,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-12-02 08:26:02,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:26:02,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-12-02 08:26:02,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-12-02 08:26:02,064 INFO L87 Difference]: Start difference. First operand 623 states and 848 transitions. Second operand has 8 states, 8 states have (on average 12.25) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:26:02,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:26:02,707 INFO L93 Difference]: Finished difference Result 1283 states and 1763 transitions. [2024-12-02 08:26:02,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-12-02 08:26:02,707 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.25) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2024-12-02 08:26:02,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:26:02,709 INFO L225 Difference]: With dead ends: 1283 [2024-12-02 08:26:02,709 INFO L226 Difference]: Without dead ends: 852 [2024-12-02 08:26:02,709 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-12-02 08:26:02,710 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 345 mSDsluCounter, 1212 mSDsCounter, 0 mSdLazyCounter, 1130 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 1426 SdHoareTripleChecker+Invalid, 1135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-12-02 08:26:02,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 1426 Invalid, 1135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1130 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-12-02 08:26:02,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2024-12-02 08:26:02,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 711. [2024-12-02 08:26:02,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 711 states, 710 states have (on average 1.3746478873239436) internal successors, (976), 710 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:26:02,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 976 transitions. [2024-12-02 08:26:02,715 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 976 transitions. Word has length 98 [2024-12-02 08:26:02,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:26:02,715 INFO L471 AbstractCegarLoop]: Abstraction has 711 states and 976 transitions. [2024-12-02 08:26:02,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.25) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:26:02,716 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 976 transitions. [2024-12-02 08:26:02,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-12-02 08:26:02,716 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:26:02,716 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:26:02,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-12-02 08:26:02,716 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 08:26:02,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:26:02,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1619808974, now seen corresponding path program 1 times [2024-12-02 08:26:02,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:26:02,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141730473] [2024-12-02 08:26:02,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:26:02,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:26:03,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 08:26:03,042 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-02 08:26:03,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 08:26:03,442 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-02 08:26:03,442 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-02 08:26:03,443 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-12-02 08:26:03,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-12-02 08:26:03,447 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] [2024-12-02 08:26:03,513 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-12-02 08:26:03,516 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 08:26:03 BoogieIcfgContainer [2024-12-02 08:26:03,516 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-12-02 08:26:03,517 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-02 08:26:03,517 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-02 08:26:03,517 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-02 08:26:03,518 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:24:32" (3/4) ... [2024-12-02 08:26:03,520 INFO L149 WitnessPrinter]: No result that supports witness generation found [2024-12-02 08:26:03,520 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-02 08:26:03,521 INFO L158 Benchmark]: Toolchain (without parser) took 92975.51ms. Allocated memory was 117.4MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 91.8MB in the beginning and 764.4MB in the end (delta: -672.6MB). Peak memory consumption was 569.7MB. Max. memory is 16.1GB. [2024-12-02 08:26:03,521 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 117.4MB. Free memory was 73.3MB in the beginning and 73.2MB in the end (delta: 87.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 08:26:03,521 INFO L158 Benchmark]: CACSL2BoogieTranslator took 366.45ms. Allocated memory is still 117.4MB. Free memory was 91.6MB in the beginning and 64.1MB in the end (delta: 27.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-12-02 08:26:03,521 INFO L158 Benchmark]: Boogie Procedure Inliner took 108.87ms. Allocated memory is still 117.4MB. Free memory was 64.1MB in the beginning and 42.2MB in the end (delta: 22.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-12-02 08:26:03,522 INFO L158 Benchmark]: Boogie Preprocessor took 172.23ms. Allocated memory is still 117.4MB. Free memory was 42.2MB in the beginning and 77.2MB in the end (delta: -35.0MB). Peak memory consumption was 32.2MB. Max. memory is 16.1GB. [2024-12-02 08:26:03,522 INFO L158 Benchmark]: RCFGBuilder took 1394.68ms. Allocated memory is still 117.4MB. Free memory was 77.2MB in the beginning and 65.7MB in the end (delta: 11.4MB). Peak memory consumption was 51.8MB. Max. memory is 16.1GB. [2024-12-02 08:26:03,522 INFO L158 Benchmark]: TraceAbstraction took 90924.11ms. Allocated memory was 117.4MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 65.0MB in the beginning and 764.5MB in the end (delta: -699.5MB). Peak memory consumption was 545.3MB. Max. memory is 16.1GB. [2024-12-02 08:26:03,522 INFO L158 Benchmark]: Witness Printer took 3.76ms. Allocated memory is still 1.4GB. Free memory was 764.5MB in the beginning and 764.4MB in the end (delta: 120.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 08:26:03,523 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.35ms. Allocated memory is still 117.4MB. Free memory was 73.3MB in the beginning and 73.2MB in the end (delta: 87.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 366.45ms. Allocated memory is still 117.4MB. Free memory was 91.6MB in the beginning and 64.1MB in the end (delta: 27.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 108.87ms. Allocated memory is still 117.4MB. Free memory was 64.1MB in the beginning and 42.2MB in the end (delta: 22.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 172.23ms. Allocated memory is still 117.4MB. Free memory was 42.2MB in the beginning and 77.2MB in the end (delta: -35.0MB). Peak memory consumption was 32.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1394.68ms. Allocated memory is still 117.4MB. Free memory was 77.2MB in the beginning and 65.7MB in the end (delta: 11.4MB). Peak memory consumption was 51.8MB. Max. memory is 16.1GB. * TraceAbstraction took 90924.11ms. Allocated memory was 117.4MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 65.0MB in the beginning and 764.5MB in the end (delta: -699.5MB). Peak memory consumption was 545.3MB. Max. memory is 16.1GB. * Witness Printer took 3.76ms. Allocated memory is still 1.4GB. Free memory was 764.5MB in the beginning and 764.4MB in the end (delta: 120.8kB). There was no memory consumed. 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 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 213, overapproximation of bitwiseAnd at line 189, overapproximation of bitwiseAnd at line 201, overapproximation of bitwiseAnd at line 354, overapproximation of bitwiseAnd at line 207, overapproximation of bitwiseAnd at line 195, overapproximation of bitwiseAnd at line 181, overapproximation of bitwiseAnd at line 225, overapproximation of bitwiseAnd at line 219, overapproximation of bitwiseAnd at line 343. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 12); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (12 - 1); [L32] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 3); [L33] const SORT_5 msb_SORT_5 = (SORT_5)1 << (3 - 1); [L35] const SORT_9 mask_SORT_9 = (SORT_9)-1 >> (sizeof(SORT_9) * 8 - 32); [L36] const SORT_9 msb_SORT_9 = (SORT_9)1 << (32 - 1); [L38] const SORT_46 mask_SORT_46 = (SORT_46)-1 >> (sizeof(SORT_46) * 8 - 5); [L39] const SORT_46 msb_SORT_46 = (SORT_46)1 << (5 - 1); [L41] const SORT_3 var_4 = 576; [L42] const SORT_5 var_6 = 0; [L43] const SORT_9 var_11 = 6; [L44] const SORT_3 var_14 = 36; [L45] const SORT_9 var_16 = 5; [L46] const SORT_3 var_19 = 2544; [L47] const SORT_9 var_21 = 4; [L48] const SORT_3 var_24 = 9; [L49] const SORT_9 var_26 = 3; [L50] const SORT_3 var_29 = 54; [L51] const SORT_9 var_31 = 2; [L52] const SORT_3 var_34 = 18; [L53] const SORT_9 var_36 = 1; [L54] const SORT_9 var_40 = 0; [L55] const SORT_46 var_47 = 0; [L56] const SORT_46 var_79 = 1; [L57] const SORT_1 var_116 = 1; [L58] const SORT_9 var_159 = 7; [L60] SORT_1 input_2; [L61] SORT_46 input_143; [L62] SORT_46 input_156; [L63] SORT_46 input_167; [L64] SORT_46 input_174; [L65] SORT_46 input_181; [L66] SORT_46 input_188; [L67] SORT_46 input_195; [L68] SORT_46 input_202; [L70] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_47=0, var_4=576, var_6=0, var_79=1] [L70] SORT_5 state_7 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L71] EXPR __VERIFIER_nondet_uchar() & mask_SORT_46 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_47=0, var_4=576, var_6=0, var_79=1] [L71] SORT_46 state_48 = __VERIFIER_nondet_uchar() & mask_SORT_46; [L72] EXPR __VERIFIER_nondet_uchar() & mask_SORT_46 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_47=0, var_4=576, var_6=0, var_79=1] [L72] SORT_46 state_50 = __VERIFIER_nondet_uchar() & mask_SORT_46; [L73] EXPR __VERIFIER_nondet_uchar() & mask_SORT_46 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_47=0, var_4=576, var_6=0, var_79=1] [L73] SORT_46 state_56 = __VERIFIER_nondet_uchar() & mask_SORT_46; [L74] EXPR __VERIFIER_nondet_uchar() & mask_SORT_46 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_47=0, var_4=576, var_6=0, var_79=1] [L74] SORT_46 state_64 = __VERIFIER_nondet_uchar() & mask_SORT_46; [L75] EXPR __VERIFIER_nondet_uchar() & mask_SORT_46 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_47=0, var_4=576, var_6=0, var_79=1] [L75] SORT_46 state_69 = __VERIFIER_nondet_uchar() & mask_SORT_46; [L76] EXPR __VERIFIER_nondet_uchar() & mask_SORT_46 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_47=0, var_4=576, var_6=0, var_79=1] [L76] SORT_46 state_74 = __VERIFIER_nondet_uchar() & mask_SORT_46; [L77] EXPR __VERIFIER_nondet_uchar() & mask_SORT_46 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_47=0, var_4=576, var_6=0, var_79=1] [L77] SORT_46 state_80 = __VERIFIER_nondet_uchar() & mask_SORT_46; [L79] SORT_5 init_8_arg_1 = var_6; [L80] state_7 = init_8_arg_1 [L81] SORT_46 init_49_arg_1 = var_47; [L82] state_48 = init_49_arg_1 [L83] SORT_46 init_51_arg_1 = var_47; [L84] state_50 = init_51_arg_1 [L85] SORT_46 init_57_arg_1 = var_47; [L86] state_56 = init_57_arg_1 [L87] SORT_46 init_65_arg_1 = var_47; [L88] state_64 = init_65_arg_1 [L89] SORT_46 init_70_arg_1 = var_47; [L90] state_69 = init_70_arg_1 [L91] SORT_46 init_75_arg_1 = var_47; [L92] state_74 = init_75_arg_1 [L93] SORT_46 init_81_arg_1 = var_79; [L94] state_80 = init_81_arg_1 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_4=576] [L97] input_2 = __VERIFIER_nondet_uchar() [L98] input_143 = __VERIFIER_nondet_uchar() [L99] input_156 = __VERIFIER_nondet_uchar() [L100] input_167 = __VERIFIER_nondet_uchar() [L101] input_174 = __VERIFIER_nondet_uchar() [L102] input_181 = __VERIFIER_nondet_uchar() [L103] input_188 = __VERIFIER_nondet_uchar() [L104] input_195 = __VERIFIER_nondet_uchar() [L105] input_202 = __VERIFIER_nondet_uchar() [L108] SORT_5 var_39_arg_0 = state_7; VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_39_arg_0=0, var_40=0, var_4=576] [L109] EXPR var_39_arg_0 & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_4=576] [L109] var_39_arg_0 = var_39_arg_0 & mask_SORT_5 [L110] SORT_9 var_39 = var_39_arg_0; [L111] SORT_9 var_41_arg_0 = var_39; [L112] SORT_9 var_41_arg_1 = var_40; [L113] SORT_1 var_41 = var_41_arg_0 == var_41_arg_1; [L114] SORT_5 var_35_arg_0 = state_7; VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_35_arg_0=0, var_36=1, var_40=0, var_41=1, var_4=576] [L115] EXPR var_35_arg_0 & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_41=1, var_4=576] [L115] var_35_arg_0 = var_35_arg_0 & mask_SORT_5 [L116] SORT_9 var_35 = var_35_arg_0; [L117] SORT_9 var_37_arg_0 = var_35; [L118] SORT_9 var_37_arg_1 = var_36; [L119] SORT_1 var_37 = var_37_arg_0 == var_37_arg_1; [L120] SORT_5 var_30_arg_0 = state_7; VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_30_arg_0=0, var_31=2, var_34=18, var_36=1, var_37=0, var_40=0, var_41=1, var_4=576] [L121] EXPR var_30_arg_0 & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_37=0, var_40=0, var_41=1, var_4=576] [L121] var_30_arg_0 = var_30_arg_0 & mask_SORT_5 [L122] SORT_9 var_30 = var_30_arg_0; [L123] SORT_9 var_32_arg_0 = var_30; [L124] SORT_9 var_32_arg_1 = var_31; [L125] SORT_1 var_32 = var_32_arg_0 == var_32_arg_1; [L126] SORT_5 var_25_arg_0 = state_7; VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_25_arg_0=0, var_26=3, var_29=54, var_31=2, var_32=0, var_34=18, var_36=1, var_37=0, var_40=0, var_41=1, var_4=576] [L127] EXPR var_25_arg_0 & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_32=0, var_34=18, var_36=1, var_37=0, var_40=0, var_41=1, var_4=576] [L127] var_25_arg_0 = var_25_arg_0 & mask_SORT_5 [L128] SORT_9 var_25 = var_25_arg_0; [L129] SORT_9 var_27_arg_0 = var_25; [L130] SORT_9 var_27_arg_1 = var_26; [L131] SORT_1 var_27 = var_27_arg_0 == var_27_arg_1; [L132] SORT_5 var_20_arg_0 = state_7; VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_20_arg_0=0, var_21=4, var_24=9, var_26=3, var_27=0, var_29=54, var_31=2, var_32=0, var_34=18, var_36=1, var_37=0, var_40=0, var_41=1, var_4=576] [L133] EXPR var_20_arg_0 & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_27=0, var_29=54, var_31=2, var_32=0, var_34=18, var_36=1, var_37=0, var_40=0, var_41=1, var_4=576] [L133] var_20_arg_0 = var_20_arg_0 & mask_SORT_5 [L134] SORT_9 var_20 = var_20_arg_0; [L135] SORT_9 var_22_arg_0 = var_20; [L136] SORT_9 var_22_arg_1 = var_21; [L137] SORT_1 var_22 = var_22_arg_0 == var_22_arg_1; [L138] SORT_5 var_15_arg_0 = state_7; VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_15_arg_0=0, var_16=5, var_19=2544, var_21=4, var_22=0, var_24=9, var_26=3, var_27=0, var_29=54, var_31=2, var_32=0, var_34=18, var_36=1, var_37=0, var_40=0, var_41=1, var_4=576] [L139] EXPR var_15_arg_0 & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_22=0, var_24=9, var_26=3, var_27=0, var_29=54, var_31=2, var_32=0, var_34=18, var_36=1, var_37=0, var_40=0, var_41=1, var_4=576] [L139] var_15_arg_0 = var_15_arg_0 & mask_SORT_5 [L140] SORT_9 var_15 = var_15_arg_0; [L141] SORT_9 var_17_arg_0 = var_15; [L142] SORT_9 var_17_arg_1 = var_16; [L143] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L144] SORT_5 var_10_arg_0 = state_7; VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_10_arg_0=0, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_17=0, var_19=2544, var_21=4, var_22=0, var_24=9, var_26=3, var_27=0, var_29=54, var_31=2, var_32=0, var_34=18, var_36=1, var_37=0, var_40=0, var_41=1, var_4=576] [L145] EXPR var_10_arg_0 & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_17=0, var_19=2544, var_21=4, var_22=0, var_24=9, var_26=3, var_27=0, var_29=54, var_31=2, var_32=0, var_34=18, var_36=1, var_37=0, var_40=0, var_41=1, var_4=576] [L145] var_10_arg_0 = var_10_arg_0 & mask_SORT_5 [L146] SORT_9 var_10 = var_10_arg_0; [L147] SORT_9 var_12_arg_0 = var_10; [L148] SORT_9 var_12_arg_1 = var_11; [L149] SORT_1 var_12 = var_12_arg_0 == var_12_arg_1; [L150] SORT_1 var_13_arg_0 = var_12; [L151] SORT_3 var_13_arg_1 = var_4; [L152] SORT_3 var_13_arg_2 = var_4; [L153] SORT_3 var_13 = var_13_arg_0 ? var_13_arg_1 : var_13_arg_2; [L154] SORT_1 var_18_arg_0 = var_17; [L155] SORT_3 var_18_arg_1 = var_14; [L156] SORT_3 var_18_arg_2 = var_13; [L157] SORT_3 var_18 = var_18_arg_0 ? var_18_arg_1 : var_18_arg_2; [L158] SORT_1 var_23_arg_0 = var_22; [L159] SORT_3 var_23_arg_1 = var_19; [L160] SORT_3 var_23_arg_2 = var_18; [L161] SORT_3 var_23 = var_23_arg_0 ? var_23_arg_1 : var_23_arg_2; [L162] SORT_1 var_28_arg_0 = var_27; [L163] SORT_3 var_28_arg_1 = var_24; [L164] SORT_3 var_28_arg_2 = var_23; [L165] SORT_3 var_28 = var_28_arg_0 ? var_28_arg_1 : var_28_arg_2; [L166] SORT_1 var_33_arg_0 = var_32; [L167] SORT_3 var_33_arg_1 = var_29; [L168] SORT_3 var_33_arg_2 = var_28; [L169] SORT_3 var_33 = var_33_arg_0 ? var_33_arg_1 : var_33_arg_2; [L170] SORT_1 var_38_arg_0 = var_37; [L171] SORT_3 var_38_arg_1 = var_34; [L172] SORT_3 var_38_arg_2 = var_33; [L173] SORT_3 var_38 = var_38_arg_0 ? var_38_arg_1 : var_38_arg_2; [L174] SORT_1 var_42_arg_0 = var_41; [L175] SORT_3 var_42_arg_1 = var_14; [L176] SORT_3 var_42_arg_2 = var_38; [L177] SORT_3 var_42 = var_42_arg_0 ? var_42_arg_1 : var_42_arg_2; [L178] SORT_3 var_43_arg_0 = var_42; [L179] SORT_5 var_43 = var_43_arg_0 >> 0; [L180] SORT_5 var_44_arg_0 = var_43; VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_44_arg_0=36, var_4=576] [L181] EXPR var_44_arg_0 & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_4=576] [L181] var_44_arg_0 = var_44_arg_0 & mask_SORT_5 [L182] SORT_9 var_44 = var_44_arg_0; [L183] SORT_9 var_45_arg_0 = var_44; [L184] SORT_9 var_45_arg_1 = var_21; [L185] SORT_1 var_45 = var_45_arg_0 == var_45_arg_1; [L186] SORT_3 var_52_arg_0 = var_42; [L187] SORT_5 var_52 = var_52_arg_0 >> 3; [L188] SORT_5 var_82_arg_0 = var_52; VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_45=0, var_4=576, var_52=4, var_82_arg_0=4] [L189] EXPR var_82_arg_0 & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_45=0, var_4=576, var_52=4] [L189] var_82_arg_0 = var_82_arg_0 & mask_SORT_5 [L190] SORT_9 var_82 = var_82_arg_0; [L191] SORT_9 var_83_arg_0 = var_82; [L192] SORT_9 var_83_arg_1 = var_40; [L193] SORT_1 var_83 = var_83_arg_0 == var_83_arg_1; [L194] SORT_5 var_76_arg_0 = var_52; VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_45=0, var_4=576, var_52=4, var_76_arg_0=4, var_83=0] [L195] EXPR var_76_arg_0 & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_45=0, var_4=576, var_52=4, var_83=0] [L195] var_76_arg_0 = var_76_arg_0 & mask_SORT_5 [L196] SORT_9 var_76 = var_76_arg_0; [L197] SORT_9 var_77_arg_0 = var_76; [L198] SORT_9 var_77_arg_1 = var_36; [L199] SORT_1 var_77 = var_77_arg_0 == var_77_arg_1; [L200] SORT_5 var_71_arg_0 = var_52; VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_45=0, var_4=576, var_52=4, var_71_arg_0=4, var_77=0, var_83=0] [L201] EXPR var_71_arg_0 & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_45=0, var_4=576, var_52=4, var_77=0, var_83=0] [L201] var_71_arg_0 = var_71_arg_0 & mask_SORT_5 [L202] SORT_9 var_71 = var_71_arg_0; [L203] SORT_9 var_72_arg_0 = var_71; [L204] SORT_9 var_72_arg_1 = var_31; [L205] SORT_1 var_72 = var_72_arg_0 == var_72_arg_1; [L206] SORT_5 var_66_arg_0 = var_52; VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_45=0, var_4=576, var_52=4, var_66_arg_0=4, var_72=0, var_77=0, var_83=0] [L207] EXPR var_66_arg_0 & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_45=0, var_4=576, var_52=4, var_72=0, var_77=0, var_83=0] [L207] var_66_arg_0 = var_66_arg_0 & mask_SORT_5 [L208] SORT_9 var_66 = var_66_arg_0; [L209] SORT_9 var_67_arg_0 = var_66; [L210] SORT_9 var_67_arg_1 = var_26; [L211] SORT_1 var_67 = var_67_arg_0 == var_67_arg_1; [L212] SORT_5 var_61_arg_0 = var_52; VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_45=0, var_4=576, var_52=4, var_61_arg_0=4, var_67=0, var_72=0, var_77=0, var_83=0] [L213] EXPR var_61_arg_0 & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_45=0, var_4=576, var_52=4, var_67=0, var_72=0, var_77=0, var_83=0] [L213] var_61_arg_0 = var_61_arg_0 & mask_SORT_5 [L214] SORT_9 var_61 = var_61_arg_0; [L215] SORT_9 var_62_arg_0 = var_61; [L216] SORT_9 var_62_arg_1 = var_21; [L217] SORT_1 var_62 = var_62_arg_0 == var_62_arg_1; [L218] SORT_5 var_58_arg_0 = var_52; VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_45=0, var_4=576, var_52=4, var_58_arg_0=4, var_62=0, var_67=0, var_72=0, var_77=0, var_83=0] [L219] EXPR var_58_arg_0 & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_45=0, var_4=576, var_52=4, var_62=0, var_67=0, var_72=0, var_77=0, var_83=0] [L219] var_58_arg_0 = var_58_arg_0 & mask_SORT_5 [L220] SORT_9 var_58 = var_58_arg_0; [L221] SORT_9 var_59_arg_0 = var_58; [L222] SORT_9 var_59_arg_1 = var_16; [L223] SORT_1 var_59 = var_59_arg_0 == var_59_arg_1; [L224] SORT_5 var_53_arg_0 = var_52; VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_45=0, var_4=576, var_53_arg_0=4, var_59=0, var_62=0, var_67=0, var_72=0, var_77=0, var_83=0] [L225] EXPR var_53_arg_0 & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_45=0, var_4=576, var_59=0, var_62=0, var_67=0, var_72=0, var_77=0, var_83=0] [L225] var_53_arg_0 = var_53_arg_0 & mask_SORT_5 [L226] SORT_9 var_53 = var_53_arg_0; [L227] SORT_9 var_54_arg_0 = var_53; [L228] SORT_9 var_54_arg_1 = var_11; [L229] SORT_1 var_54 = var_54_arg_0 == var_54_arg_1; [L230] SORT_1 var_55_arg_0 = var_54; [L231] SORT_46 var_55_arg_1 = state_50; [L232] SORT_46 var_55_arg_2 = state_48; [L233] SORT_46 var_55 = var_55_arg_0 ? var_55_arg_1 : var_55_arg_2; [L234] SORT_1 var_60_arg_0 = var_59; [L235] SORT_46 var_60_arg_1 = state_56; [L236] SORT_46 var_60_arg_2 = var_55; [L237] SORT_46 var_60 = var_60_arg_0 ? var_60_arg_1 : var_60_arg_2; [L238] SORT_1 var_63_arg_0 = var_62; [L239] SORT_46 var_63_arg_1 = state_56; [L240] SORT_46 var_63_arg_2 = var_60; [L241] SORT_46 var_63 = var_63_arg_0 ? var_63_arg_1 : var_63_arg_2; [L242] SORT_1 var_68_arg_0 = var_67; [L243] SORT_46 var_68_arg_1 = state_64; [L244] SORT_46 var_68_arg_2 = var_63; [L245] SORT_46 var_68 = var_68_arg_0 ? var_68_arg_1 : var_68_arg_2; [L246] SORT_1 var_73_arg_0 = var_72; [L247] SORT_46 var_73_arg_1 = state_69; [L248] SORT_46 var_73_arg_2 = var_68; [L249] SORT_46 var_73 = var_73_arg_0 ? var_73_arg_1 : var_73_arg_2; [L250] SORT_1 var_78_arg_0 = var_77; [L251] SORT_46 var_78_arg_1 = state_74; [L252] SORT_46 var_78_arg_2 = var_73; [L253] SORT_46 var_78 = var_78_arg_0 ? var_78_arg_1 : var_78_arg_2; [L254] SORT_1 var_84_arg_0 = var_83; [L255] SORT_46 var_84_arg_1 = state_80; [L256] SORT_46 var_84_arg_2 = var_78; [L257] SORT_46 var_84 = var_84_arg_0 ? var_84_arg_1 : var_84_arg_2; [L258] SORT_46 var_85_arg_0 = var_84; VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_45=0, var_4=576, var_84=0, var_85_arg_0=0] [L259] EXPR var_85_arg_0 & mask_SORT_46 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_45=0, var_4=576, var_84=0] [L259] var_85_arg_0 = var_85_arg_0 & mask_SORT_46 [L260] SORT_9 var_85 = var_85_arg_0; [L261] SORT_9 var_86_arg_0 = var_85; [L262] SORT_9 var_86_arg_1 = var_40; [L263] SORT_1 var_86 = var_86_arg_0 == var_86_arg_1; [L264] SORT_1 var_87_arg_0 = var_45; [L265] SORT_1 var_87_arg_1 = var_86; VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_4=576, var_84=0, var_87_arg_0=0, var_87_arg_1=1] [L266] EXPR var_87_arg_0 & var_87_arg_1 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_4=576, var_84=0] [L266] SORT_1 var_87 = var_87_arg_0 & var_87_arg_1; [L267] SORT_1 var_88_arg_0 = var_87; [L268] SORT_1 var_88 = ~var_88_arg_0; [L269] SORT_3 var_89_arg_0 = var_42; [L270] SORT_5 var_89 = var_89_arg_0 >> 6; [L271] SORT_5 var_108_arg_0 = var_89; VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_108_arg_0=0, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_4=576, var_84=0, var_88=-1, var_89=0] [L272] EXPR var_108_arg_0 & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_4=576, var_84=0, var_88=-1, var_89=0] [L272] var_108_arg_0 = var_108_arg_0 & mask_SORT_5 [L273] SORT_9 var_108 = var_108_arg_0; [L274] SORT_9 var_109_arg_0 = var_108; [L275] SORT_9 var_109_arg_1 = var_40; [L276] SORT_1 var_109 = var_109_arg_0 == var_109_arg_1; [L277] SORT_5 var_105_arg_0 = var_89; VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_105_arg_0=0, var_109=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_4=576, var_84=0, var_88=-1, var_89=0] [L278] EXPR var_105_arg_0 & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_109=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_4=576, var_84=0, var_88=-1, var_89=0] [L278] var_105_arg_0 = var_105_arg_0 & mask_SORT_5 [L279] SORT_9 var_105 = var_105_arg_0; [L280] SORT_9 var_106_arg_0 = var_105; [L281] SORT_9 var_106_arg_1 = var_36; [L282] SORT_1 var_106 = var_106_arg_0 == var_106_arg_1; [L283] SORT_5 var_102_arg_0 = var_89; VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_102_arg_0=0, var_106=0, var_109=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_4=576, var_84=0, var_88=-1, var_89=0] [L284] EXPR var_102_arg_0 & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_106=0, var_109=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_4=576, var_84=0, var_88=-1, var_89=0] [L284] var_102_arg_0 = var_102_arg_0 & mask_SORT_5 [L285] SORT_9 var_102 = var_102_arg_0; [L286] SORT_9 var_103_arg_0 = var_102; [L287] SORT_9 var_103_arg_1 = var_31; [L288] SORT_1 var_103 = var_103_arg_0 == var_103_arg_1; [L289] SORT_5 var_99_arg_0 = var_89; VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_103=0, var_106=0, var_109=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_4=576, var_84=0, var_88=-1, var_89=0, var_99_arg_0=0] [L290] EXPR var_99_arg_0 & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_103=0, var_106=0, var_109=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_4=576, var_84=0, var_88=-1, var_89=0] [L290] var_99_arg_0 = var_99_arg_0 & mask_SORT_5 [L291] SORT_9 var_99 = var_99_arg_0; [L292] SORT_9 var_100_arg_0 = var_99; [L293] SORT_9 var_100_arg_1 = var_26; [L294] SORT_1 var_100 = var_100_arg_0 == var_100_arg_1; [L295] SORT_5 var_96_arg_0 = var_89; VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_100=0, var_103=0, var_106=0, var_109=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_4=576, var_84=0, var_88=-1, var_89=0, var_96_arg_0=0] [L296] EXPR var_96_arg_0 & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_100=0, var_103=0, var_106=0, var_109=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_4=576, var_84=0, var_88=-1, var_89=0] [L296] var_96_arg_0 = var_96_arg_0 & mask_SORT_5 [L297] SORT_9 var_96 = var_96_arg_0; [L298] SORT_9 var_97_arg_0 = var_96; [L299] SORT_9 var_97_arg_1 = var_21; [L300] SORT_1 var_97 = var_97_arg_0 == var_97_arg_1; [L301] SORT_5 var_93_arg_0 = var_89; VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_100=0, var_103=0, var_106=0, var_109=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_4=576, var_84=0, var_88=-1, var_89=0, var_93_arg_0=0, var_97=0] [L302] EXPR var_93_arg_0 & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_100=0, var_103=0, var_106=0, var_109=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_4=576, var_84=0, var_88=-1, var_89=0, var_97=0] [L302] var_93_arg_0 = var_93_arg_0 & mask_SORT_5 [L303] SORT_9 var_93 = var_93_arg_0; [L304] SORT_9 var_94_arg_0 = var_93; [L305] SORT_9 var_94_arg_1 = var_16; [L306] SORT_1 var_94 = var_94_arg_0 == var_94_arg_1; [L307] SORT_5 var_90_arg_0 = var_89; VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_100=0, var_103=0, var_106=0, var_109=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_4=576, var_84=0, var_88=-1, var_90_arg_0=0, var_94=0, var_97=0] [L308] EXPR var_90_arg_0 & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_100=0, var_103=0, var_106=0, var_109=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_4=576, var_84=0, var_88=-1, var_94=0, var_97=0] [L308] var_90_arg_0 = var_90_arg_0 & mask_SORT_5 [L309] SORT_9 var_90 = var_90_arg_0; [L310] SORT_9 var_91_arg_0 = var_90; [L311] SORT_9 var_91_arg_1 = var_11; [L312] SORT_1 var_91 = var_91_arg_0 == var_91_arg_1; [L313] SORT_1 var_92_arg_0 = var_91; [L314] SORT_46 var_92_arg_1 = state_50; [L315] SORT_46 var_92_arg_2 = state_48; [L316] SORT_46 var_92 = var_92_arg_0 ? var_92_arg_1 : var_92_arg_2; [L317] SORT_1 var_95_arg_0 = var_94; [L318] SORT_46 var_95_arg_1 = state_56; [L319] SORT_46 var_95_arg_2 = var_92; [L320] SORT_46 var_95 = var_95_arg_0 ? var_95_arg_1 : var_95_arg_2; [L321] SORT_1 var_98_arg_0 = var_97; [L322] SORT_46 var_98_arg_1 = state_56; [L323] SORT_46 var_98_arg_2 = var_95; [L324] SORT_46 var_98 = var_98_arg_0 ? var_98_arg_1 : var_98_arg_2; [L325] SORT_1 var_101_arg_0 = var_100; [L326] SORT_46 var_101_arg_1 = state_64; [L327] SORT_46 var_101_arg_2 = var_98; [L328] SORT_46 var_101 = var_101_arg_0 ? var_101_arg_1 : var_101_arg_2; [L329] SORT_1 var_104_arg_0 = var_103; [L330] SORT_46 var_104_arg_1 = state_69; [L331] SORT_46 var_104_arg_2 = var_101; [L332] SORT_46 var_104 = var_104_arg_0 ? var_104_arg_1 : var_104_arg_2; [L333] SORT_1 var_107_arg_0 = var_106; [L334] SORT_46 var_107_arg_1 = state_74; [L335] SORT_46 var_107_arg_2 = var_104; [L336] SORT_46 var_107 = var_107_arg_0 ? var_107_arg_1 : var_107_arg_2; [L337] SORT_1 var_110_arg_0 = var_109; [L338] SORT_46 var_110_arg_1 = state_80; [L339] SORT_46 var_110_arg_2 = var_107; [L340] SORT_46 var_110 = var_110_arg_0 ? var_110_arg_1 : var_110_arg_2; [L341] SORT_46 var_111_arg_0 = var_110; [L342] SORT_5 var_111 = var_111_arg_0 >> 0; VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_110=1, var_111=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_4=576, var_84=0, var_88=-1] [L343] EXPR var_111 & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_110=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_4=576, var_84=0, var_88=-1] [L343] var_111 = var_111 & mask_SORT_5 [L344] SORT_5 var_112_arg_0 = state_7; [L345] SORT_5 var_112_arg_1 = var_111; [L346] SORT_1 var_112 = var_112_arg_0 == var_112_arg_1; [L347] SORT_1 var_113_arg_0 = var_88; [L348] SORT_1 var_113_arg_1 = var_112; VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_110=1, var_111=1, var_113_arg_0=-1, var_113_arg_1=0, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_4=576, var_84=0] [L349] EXPR var_113_arg_0 & var_113_arg_1 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_110=1, var_111=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_4=576, var_84=0] [L349] SORT_1 var_113 = var_113_arg_0 & var_113_arg_1; [L350] SORT_1 var_117_arg_0 = var_113; [L351] SORT_1 var_117 = ~var_117_arg_0; [L352] SORT_1 var_118_arg_0 = var_116; [L353] SORT_1 var_118_arg_1 = var_117; VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_110=1, var_111=1, var_116=1, var_118_arg_0=1, var_118_arg_1=-1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_4=576, var_84=0] [L354] EXPR var_118_arg_0 & var_118_arg_1 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_110=1, var_111=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_4=576, var_84=0] [L354] SORT_1 var_118 = var_118_arg_0 & var_118_arg_1; [L355] EXPR var_118 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_110=1, var_111=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_4=576, var_84=0] [L355] var_118 = var_118 & mask_SORT_1 [L356] SORT_1 bad_119_arg_0 = var_118; [L357] CALL __VERIFIER_assert(!(bad_119_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 255 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 90.8s, OverallIterations: 51, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 38.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 20464 SdHoareTripleChecker+Valid, 32.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 20464 mSDsluCounter, 65063 SdHoareTripleChecker+Invalid, 28.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 52103 mSDsCounter, 55 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 51859 IncrementalHoareTripleChecker+Invalid, 51914 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 55 mSolverCounterUnsat, 12960 mSDtfsCounter, 51859 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 619 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 485 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 941 ImplicationChecksByTransitivity, 7.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=711occurred in iteration=50, InterpolantAutomatonStates: 391, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 50 MinimizatonAttempts, 3839 StatesRemovedByMinimization, 46 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 9.8s SatisfiabilityAnalysisTime, 40.4s InterpolantComputationTime, 4492 NumberOfCodeBlocks, 4492 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 4344 ConstructedInterpolants, 0 QuantifiedInterpolants, 28231 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 50 InterpolantComputations, 50 PerfectInterpolantSequences, 0/0 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 could not prove your program: unable to determine feasibility of some traces [2024-12-02 08:26:03,544 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_958282b6-ffe3-4edf-90c9-afd3f3e53f1e/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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_958282b6-ffe3-4edf-90c9-afd3f3e53f1e/bin/uautomizer-verify-84ZbGMXZE1/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_958282b6-ffe3-4edf-90c9-afd3f3e53f1e/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_958282b6-ffe3-4edf-90c9-afd3f3e53f1e/bin/uautomizer-verify-84ZbGMXZE1/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_958282b6-ffe3-4edf-90c9-afd3f3e53f1e/bin/uautomizer-verify-84ZbGMXZE1/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.v_non-pipelined-microprocessor.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_958282b6-ffe3-4edf-90c9-afd3f3e53f1e/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_958282b6-ffe3-4edf-90c9-afd3f3e53f1e/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 64bit --witnessprinter.graph.data.programhash 013fc4a889617293119ec23d82d2fd495e032e9bab1929da87247ff74d1355ed --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-02 08:26:05,460 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-02 08:26:05,539 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_958282b6-ffe3-4edf-90c9-afd3f3e53f1e/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-12-02 08:26:05,545 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-02 08:26:05,546 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-12-02 08:26:05,569 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-02 08:26:05,570 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-12-02 08:26:05,570 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-12-02 08:26:05,570 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-12-02 08:26:05,570 INFO L153 SettingsManager]: * Use memory slicer=true [2024-12-02 08:26:05,570 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-02 08:26:05,571 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-12-02 08:26:05,571 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-02 08:26:05,571 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-02 08:26:05,571 INFO L153 SettingsManager]: * Use SBE=true [2024-12-02 08:26:05,571 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-02 08:26:05,571 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-02 08:26:05,571 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-02 08:26:05,571 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-02 08:26:05,571 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-02 08:26:05,572 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-02 08:26:05,572 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-12-02 08:26:05,572 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-12-02 08:26:05,572 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-12-02 08:26:05,572 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-02 08:26:05,572 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-02 08:26:05,572 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-02 08:26:05,572 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-12-02 08:26:05,572 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 08:26:05,572 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 08:26:05,572 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 08:26:05,572 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 08:26:05,573 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-02 08:26:05,573 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 08:26:05,573 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 08:26:05,573 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 08:26:05,573 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 08:26:05,574 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-02 08:26:05,574 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-02 08:26:05,574 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-12-02 08:26:05,574 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-02 08:26:05,574 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-12-02 08:26:05,574 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-12-02 08:26:05,574 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-12-02 08:26:05,574 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-12-02 08:26:05,574 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-12-02 08:26:05,574 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-12-02 08:26:05,574 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_958282b6-ffe3-4edf-90c9-afd3f3e53f1e/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 013fc4a889617293119ec23d82d2fd495e032e9bab1929da87247ff74d1355ed [2024-12-02 08:26:05,803 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-02 08:26:05,811 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-02 08:26:05,814 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-02 08:26:05,815 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-02 08:26:05,816 INFO L274 PluginConnector]: CDTParser initialized [2024-12-02 08:26:05,817 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_958282b6-ffe3-4edf-90c9-afd3f3e53f1e/bin/uautomizer-verify-84ZbGMXZE1/../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.v_non-pipelined-microprocessor.c [2024-12-02 08:26:08,511 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_958282b6-ffe3-4edf-90c9-afd3f3e53f1e/bin/uautomizer-verify-84ZbGMXZE1/data/c395aa393/e5d9ffd95b314156a97b461aaaddca07/FLAG31a43f416 [2024-12-02 08:26:08,718 INFO L384 CDTParser]: Found 1 translation units. [2024-12-02 08:26:08,718 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_958282b6-ffe3-4edf-90c9-afd3f3e53f1e/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.v_non-pipelined-microprocessor.c [2024-12-02 08:26:08,728 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_958282b6-ffe3-4edf-90c9-afd3f3e53f1e/bin/uautomizer-verify-84ZbGMXZE1/data/c395aa393/e5d9ffd95b314156a97b461aaaddca07/FLAG31a43f416 [2024-12-02 08:26:08,742 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_958282b6-ffe3-4edf-90c9-afd3f3e53f1e/bin/uautomizer-verify-84ZbGMXZE1/data/c395aa393/e5d9ffd95b314156a97b461aaaddca07 [2024-12-02 08:26:08,744 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-02 08:26:08,745 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-02 08:26:08,747 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-02 08:26:08,747 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-02 08:26:08,751 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-02 08:26:08,751 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:26:08" (1/1) ... [2024-12-02 08:26:08,752 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40091eaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:26:08, skipping insertion in model container [2024-12-02 08:26:08,752 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:26:08" (1/1) ... [2024-12-02 08:26:08,779 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-02 08:26:08,916 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_958282b6-ffe3-4edf-90c9-afd3f3e53f1e/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.v_non-pipelined-microprocessor.c[1270,1283] [2024-12-02 08:26:09,035 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 08:26:09,044 INFO L200 MainTranslator]: Completed pre-run [2024-12-02 08:26:09,051 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_958282b6-ffe3-4edf-90c9-afd3f3e53f1e/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.v_non-pipelined-microprocessor.c[1270,1283] [2024-12-02 08:26:09,113 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 08:26:09,125 INFO L204 MainTranslator]: Completed translation [2024-12-02 08:26:09,126 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:26:09 WrapperNode [2024-12-02 08:26:09,126 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-02 08:26:09,127 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-02 08:26:09,127 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-02 08:26:09,127 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-02 08:26:09,132 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:26:09" (1/1) ... [2024-12-02 08:26:09,147 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:26:09" (1/1) ... [2024-12-02 08:26:09,183 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 610 [2024-12-02 08:26:09,183 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-02 08:26:09,184 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-02 08:26:09,184 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-02 08:26:09,184 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-02 08:26:09,197 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:26:09" (1/1) ... [2024-12-02 08:26:09,197 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:26:09" (1/1) ... [2024-12-02 08:26:09,203 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:26:09" (1/1) ... [2024-12-02 08:26:09,220 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 08:26:09,220 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:26:09" (1/1) ... [2024-12-02 08:26:09,220 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:26:09" (1/1) ... [2024-12-02 08:26:09,234 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:26:09" (1/1) ... [2024-12-02 08:26:09,235 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:26:09" (1/1) ... [2024-12-02 08:26:09,238 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:26:09" (1/1) ... [2024-12-02 08:26:09,241 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:26:09" (1/1) ... [2024-12-02 08:26:09,243 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:26:09" (1/1) ... [2024-12-02 08:26:09,248 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-02 08:26:09,249 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-02 08:26:09,249 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-02 08:26:09,250 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-02 08:26:09,250 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:26:09" (1/1) ... [2024-12-02 08:26:09,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 08:26:09,266 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_958282b6-ffe3-4edf-90c9-afd3f3e53f1e/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 08:26:09,275 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_958282b6-ffe3-4edf-90c9-afd3f3e53f1e/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-12-02 08:26:09,278 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_958282b6-ffe3-4edf-90c9-afd3f3e53f1e/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-12-02 08:26:09,295 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-02 08:26:09,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-12-02 08:26:09,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-02 08:26:09,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-02 08:26:09,444 INFO L234 CfgBuilder]: Building ICFG [2024-12-02 08:26:09,445 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-02 08:26:09,995 INFO L? ?]: Removed 249 outVars from TransFormulas that were not future-live. [2024-12-02 08:26:09,995 INFO L283 CfgBuilder]: Performing block encoding [2024-12-02 08:26:10,003 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-02 08:26:10,003 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2024-12-02 08:26:10,003 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:26:10 BoogieIcfgContainer [2024-12-02 08:26:10,003 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-02 08:26:10,005 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-12-02 08:26:10,005 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-12-02 08:26:10,010 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-12-02 08:26:10,010 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 08:26:08" (1/3) ... [2024-12-02 08:26:10,011 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fd420c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:26:10, skipping insertion in model container [2024-12-02 08:26:10,011 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:26:09" (2/3) ... [2024-12-02 08:26:10,011 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fd420c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:26:10, skipping insertion in model container [2024-12-02 08:26:10,011 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:26:10" (3/3) ... [2024-12-02 08:26:10,012 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.v_non-pipelined-microprocessor.c [2024-12-02 08:26:10,027 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-12-02 08:26:10,028 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.v_non-pipelined-microprocessor.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-12-02 08:26:10,068 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-12-02 08:26:10,078 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;@4b23620b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-02 08:26:10,078 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-12-02 08:26:10,082 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:26:10,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-12-02 08:26:10,087 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:26:10,087 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-12-02 08:26:10,088 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 08:26:10,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:26:10,093 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-12-02 08:26:10,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 08:26:10,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1922697916] [2024-12-02 08:26:10,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:26:10,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 08:26:10,105 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_958282b6-ffe3-4edf-90c9-afd3f3e53f1e/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 08:26:10,106 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_958282b6-ffe3-4edf-90c9-afd3f3e53f1e/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 08:26:10,108 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_958282b6-ffe3-4edf-90c9-afd3f3e53f1e/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-12-02 08:26:10,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 08:26:10,415 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-02 08:26:10,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 08:26:10,590 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2024-12-02 08:26:10,592 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-02 08:26:10,593 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-12-02 08:26:10,602 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_958282b6-ffe3-4edf-90c9-afd3f3e53f1e/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-12-02 08:26:10,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_958282b6-ffe3-4edf-90c9-afd3f3e53f1e/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 08:26:10,798 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-12-02 08:26:10,826 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-12-02 08:26:10,829 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 08:26:10 BoogieIcfgContainer [2024-12-02 08:26:10,829 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-12-02 08:26:10,830 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-02 08:26:10,830 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-02 08:26:10,830 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-02 08:26:10,831 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:26:10" (3/4) ... [2024-12-02 08:26:10,832 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-12-02 08:26:10,888 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 3. [2024-12-02 08:26:10,920 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_958282b6-ffe3-4edf-90c9-afd3f3e53f1e/bin/uautomizer-verify-84ZbGMXZE1/witness.graphml [2024-12-02 08:26:10,920 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_958282b6-ffe3-4edf-90c9-afd3f3e53f1e/bin/uautomizer-verify-84ZbGMXZE1/witness.yml [2024-12-02 08:26:10,920 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-02 08:26:10,921 INFO L158 Benchmark]: Toolchain (without parser) took 2175.85ms. Allocated memory was 92.3MB in the beginning and 134.2MB in the end (delta: 41.9MB). Free memory was 68.9MB in the beginning and 42.1MB in the end (delta: 26.8MB). Peak memory consumption was 66.9MB. Max. memory is 16.1GB. [2024-12-02 08:26:10,921 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 83.9MB. Free memory is still 48.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 08:26:10,922 INFO L158 Benchmark]: CACSL2BoogieTranslator took 379.66ms. Allocated memory is still 92.3MB. Free memory was 68.7MB in the beginning and 43.9MB in the end (delta: 24.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-12-02 08:26:10,922 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.48ms. Allocated memory is still 92.3MB. Free memory was 43.8MB in the beginning and 39.0MB in the end (delta: 4.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 08:26:10,922 INFO L158 Benchmark]: Boogie Preprocessor took 65.06ms. Allocated memory is still 92.3MB. Free memory was 39.0MB in the beginning and 61.9MB in the end (delta: -22.8MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. [2024-12-02 08:26:10,923 INFO L158 Benchmark]: RCFGBuilder took 754.12ms. Allocated memory was 92.3MB in the beginning and 134.2MB in the end (delta: 41.9MB). Free memory was 61.9MB in the beginning and 92.2MB in the end (delta: -30.3MB). Peak memory consumption was 47.0MB. Max. memory is 16.1GB. [2024-12-02 08:26:10,923 INFO L158 Benchmark]: TraceAbstraction took 823.77ms. Allocated memory is still 134.2MB. Free memory was 91.5MB in the beginning and 50.7MB in the end (delta: 40.8MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-12-02 08:26:10,923 INFO L158 Benchmark]: Witness Printer took 90.58ms. Allocated memory is still 134.2MB. Free memory was 50.1MB in the beginning and 42.1MB in the end (delta: 7.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-02 08:26:10,925 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.38ms. Allocated memory is still 83.9MB. Free memory is still 48.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 379.66ms. Allocated memory is still 92.3MB. Free memory was 68.7MB in the beginning and 43.9MB in the end (delta: 24.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.48ms. Allocated memory is still 92.3MB. Free memory was 43.8MB in the beginning and 39.0MB in the end (delta: 4.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 65.06ms. Allocated memory is still 92.3MB. Free memory was 39.0MB in the beginning and 61.9MB in the end (delta: -22.8MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. * RCFGBuilder took 754.12ms. Allocated memory was 92.3MB in the beginning and 134.2MB in the end (delta: 41.9MB). Free memory was 61.9MB in the beginning and 92.2MB in the end (delta: -30.3MB). Peak memory consumption was 47.0MB. Max. memory is 16.1GB. * TraceAbstraction took 823.77ms. Allocated memory is still 134.2MB. Free memory was 91.5MB in the beginning and 50.7MB in the end (delta: 40.8MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Witness Printer took 90.58ms. Allocated memory is still 134.2MB. Free memory was 50.1MB in the beginning and 42.1MB in the end (delta: 7.9MB). Peak memory consumption was 8.4MB. 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: 21]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 12); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (12 - 1); [L32] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 3); [L33] const SORT_5 msb_SORT_5 = (SORT_5)1 << (3 - 1); [L35] const SORT_9 mask_SORT_9 = (SORT_9)-1 >> (sizeof(SORT_9) * 8 - 32); [L36] const SORT_9 msb_SORT_9 = (SORT_9)1 << (32 - 1); [L38] const SORT_46 mask_SORT_46 = (SORT_46)-1 >> (sizeof(SORT_46) * 8 - 5); [L39] const SORT_46 msb_SORT_46 = (SORT_46)1 << (5 - 1); [L41] const SORT_3 var_4 = 576; [L42] const SORT_5 var_6 = 0; [L43] const SORT_9 var_11 = 6; [L44] const SORT_3 var_14 = 36; [L45] const SORT_9 var_16 = 5; [L46] const SORT_3 var_19 = 2544; [L47] const SORT_9 var_21 = 4; [L48] const SORT_3 var_24 = 9; [L49] const SORT_9 var_26 = 3; [L50] const SORT_3 var_29 = 54; [L51] const SORT_9 var_31 = 2; [L52] const SORT_3 var_34 = 18; [L53] const SORT_9 var_36 = 1; [L54] const SORT_9 var_40 = 0; [L55] const SORT_46 var_47 = 0; [L56] const SORT_46 var_79 = 1; [L57] const SORT_1 var_116 = 1; [L58] const SORT_9 var_159 = 7; [L60] SORT_1 input_2; [L61] SORT_46 input_143; [L62] SORT_46 input_156; [L63] SORT_46 input_167; [L64] SORT_46 input_174; [L65] SORT_46 input_181; [L66] SORT_46 input_188; [L67] SORT_46 input_195; [L68] SORT_46 input_202; [L70] SORT_5 state_7 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L71] SORT_46 state_48 = __VERIFIER_nondet_uchar() & mask_SORT_46; [L72] SORT_46 state_50 = __VERIFIER_nondet_uchar() & mask_SORT_46; [L73] SORT_46 state_56 = __VERIFIER_nondet_uchar() & mask_SORT_46; [L74] SORT_46 state_64 = __VERIFIER_nondet_uchar() & mask_SORT_46; [L75] SORT_46 state_69 = __VERIFIER_nondet_uchar() & mask_SORT_46; [L76] SORT_46 state_74 = __VERIFIER_nondet_uchar() & mask_SORT_46; [L77] SORT_46 state_80 = __VERIFIER_nondet_uchar() & mask_SORT_46; [L79] SORT_5 init_8_arg_1 = var_6; [L80] state_7 = init_8_arg_1 [L81] SORT_46 init_49_arg_1 = var_47; [L82] state_48 = init_49_arg_1 [L83] SORT_46 init_51_arg_1 = var_47; [L84] state_50 = init_51_arg_1 [L85] SORT_46 init_57_arg_1 = var_47; [L86] state_56 = init_57_arg_1 [L87] SORT_46 init_65_arg_1 = var_47; [L88] state_64 = init_65_arg_1 [L89] SORT_46 init_70_arg_1 = var_47; [L90] state_69 = init_70_arg_1 [L91] SORT_46 init_75_arg_1 = var_47; [L92] state_74 = init_75_arg_1 [L93] SORT_46 init_81_arg_1 = var_79; [L94] state_80 = init_81_arg_1 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_4=576] [L97] input_2 = __VERIFIER_nondet_uchar() [L98] input_143 = __VERIFIER_nondet_uchar() [L99] input_156 = __VERIFIER_nondet_uchar() [L100] input_167 = __VERIFIER_nondet_uchar() [L101] input_174 = __VERIFIER_nondet_uchar() [L102] input_181 = __VERIFIER_nondet_uchar() [L103] input_188 = __VERIFIER_nondet_uchar() [L104] input_195 = __VERIFIER_nondet_uchar() [L105] input_202 = __VERIFIER_nondet_uchar() [L108] SORT_5 var_39_arg_0 = state_7; [L109] var_39_arg_0 = var_39_arg_0 & mask_SORT_5 [L110] SORT_9 var_39 = var_39_arg_0; [L111] SORT_9 var_41_arg_0 = var_39; [L112] SORT_9 var_41_arg_1 = var_40; [L113] SORT_1 var_41 = var_41_arg_0 == var_41_arg_1; [L114] SORT_5 var_35_arg_0 = state_7; [L115] var_35_arg_0 = var_35_arg_0 & mask_SORT_5 [L116] SORT_9 var_35 = var_35_arg_0; [L117] SORT_9 var_37_arg_0 = var_35; [L118] SORT_9 var_37_arg_1 = var_36; [L119] SORT_1 var_37 = var_37_arg_0 == var_37_arg_1; [L120] SORT_5 var_30_arg_0 = state_7; [L121] var_30_arg_0 = var_30_arg_0 & mask_SORT_5 [L122] SORT_9 var_30 = var_30_arg_0; [L123] SORT_9 var_32_arg_0 = var_30; [L124] SORT_9 var_32_arg_1 = var_31; [L125] SORT_1 var_32 = var_32_arg_0 == var_32_arg_1; [L126] SORT_5 var_25_arg_0 = state_7; [L127] var_25_arg_0 = var_25_arg_0 & mask_SORT_5 [L128] SORT_9 var_25 = var_25_arg_0; [L129] SORT_9 var_27_arg_0 = var_25; [L130] SORT_9 var_27_arg_1 = var_26; [L131] SORT_1 var_27 = var_27_arg_0 == var_27_arg_1; [L132] SORT_5 var_20_arg_0 = state_7; [L133] var_20_arg_0 = var_20_arg_0 & mask_SORT_5 [L134] SORT_9 var_20 = var_20_arg_0; [L135] SORT_9 var_22_arg_0 = var_20; [L136] SORT_9 var_22_arg_1 = var_21; [L137] SORT_1 var_22 = var_22_arg_0 == var_22_arg_1; [L138] SORT_5 var_15_arg_0 = state_7; [L139] var_15_arg_0 = var_15_arg_0 & mask_SORT_5 [L140] SORT_9 var_15 = var_15_arg_0; [L141] SORT_9 var_17_arg_0 = var_15; [L142] SORT_9 var_17_arg_1 = var_16; [L143] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L144] SORT_5 var_10_arg_0 = state_7; [L145] var_10_arg_0 = var_10_arg_0 & mask_SORT_5 [L146] SORT_9 var_10 = var_10_arg_0; [L147] SORT_9 var_12_arg_0 = var_10; [L148] SORT_9 var_12_arg_1 = var_11; [L149] SORT_1 var_12 = var_12_arg_0 == var_12_arg_1; [L150] SORT_1 var_13_arg_0 = var_12; [L151] SORT_3 var_13_arg_1 = var_4; [L152] SORT_3 var_13_arg_2 = var_4; [L153] SORT_3 var_13 = var_13_arg_0 ? var_13_arg_1 : var_13_arg_2; [L154] SORT_1 var_18_arg_0 = var_17; [L155] SORT_3 var_18_arg_1 = var_14; [L156] SORT_3 var_18_arg_2 = var_13; [L157] SORT_3 var_18 = var_18_arg_0 ? var_18_arg_1 : var_18_arg_2; [L158] SORT_1 var_23_arg_0 = var_22; [L159] SORT_3 var_23_arg_1 = var_19; [L160] SORT_3 var_23_arg_2 = var_18; [L161] SORT_3 var_23 = var_23_arg_0 ? var_23_arg_1 : var_23_arg_2; [L162] SORT_1 var_28_arg_0 = var_27; [L163] SORT_3 var_28_arg_1 = var_24; [L164] SORT_3 var_28_arg_2 = var_23; [L165] SORT_3 var_28 = var_28_arg_0 ? var_28_arg_1 : var_28_arg_2; [L166] SORT_1 var_33_arg_0 = var_32; [L167] SORT_3 var_33_arg_1 = var_29; [L168] SORT_3 var_33_arg_2 = var_28; [L169] SORT_3 var_33 = var_33_arg_0 ? var_33_arg_1 : var_33_arg_2; [L170] SORT_1 var_38_arg_0 = var_37; [L171] SORT_3 var_38_arg_1 = var_34; [L172] SORT_3 var_38_arg_2 = var_33; [L173] SORT_3 var_38 = var_38_arg_0 ? var_38_arg_1 : var_38_arg_2; [L174] SORT_1 var_42_arg_0 = var_41; [L175] SORT_3 var_42_arg_1 = var_14; [L176] SORT_3 var_42_arg_2 = var_38; [L177] SORT_3 var_42 = var_42_arg_0 ? var_42_arg_1 : var_42_arg_2; [L178] SORT_3 var_43_arg_0 = var_42; [L179] SORT_5 var_43 = var_43_arg_0 >> 0; [L180] SORT_5 var_44_arg_0 = var_43; [L181] var_44_arg_0 = var_44_arg_0 & mask_SORT_5 [L182] SORT_9 var_44 = var_44_arg_0; [L183] SORT_9 var_45_arg_0 = var_44; [L184] SORT_9 var_45_arg_1 = var_21; [L185] SORT_1 var_45 = var_45_arg_0 == var_45_arg_1; [L186] SORT_3 var_52_arg_0 = var_42; [L187] SORT_5 var_52 = var_52_arg_0 >> 3; [L188] SORT_5 var_82_arg_0 = var_52; [L189] var_82_arg_0 = var_82_arg_0 & mask_SORT_5 [L190] SORT_9 var_82 = var_82_arg_0; [L191] SORT_9 var_83_arg_0 = var_82; [L192] SORT_9 var_83_arg_1 = var_40; [L193] SORT_1 var_83 = var_83_arg_0 == var_83_arg_1; [L194] SORT_5 var_76_arg_0 = var_52; [L195] var_76_arg_0 = var_76_arg_0 & mask_SORT_5 [L196] SORT_9 var_76 = var_76_arg_0; [L197] SORT_9 var_77_arg_0 = var_76; [L198] SORT_9 var_77_arg_1 = var_36; [L199] SORT_1 var_77 = var_77_arg_0 == var_77_arg_1; [L200] SORT_5 var_71_arg_0 = var_52; [L201] var_71_arg_0 = var_71_arg_0 & mask_SORT_5 [L202] SORT_9 var_71 = var_71_arg_0; [L203] SORT_9 var_72_arg_0 = var_71; [L204] SORT_9 var_72_arg_1 = var_31; [L205] SORT_1 var_72 = var_72_arg_0 == var_72_arg_1; [L206] SORT_5 var_66_arg_0 = var_52; [L207] var_66_arg_0 = var_66_arg_0 & mask_SORT_5 [L208] SORT_9 var_66 = var_66_arg_0; [L209] SORT_9 var_67_arg_0 = var_66; [L210] SORT_9 var_67_arg_1 = var_26; [L211] SORT_1 var_67 = var_67_arg_0 == var_67_arg_1; [L212] SORT_5 var_61_arg_0 = var_52; [L213] var_61_arg_0 = var_61_arg_0 & mask_SORT_5 [L214] SORT_9 var_61 = var_61_arg_0; [L215] SORT_9 var_62_arg_0 = var_61; [L216] SORT_9 var_62_arg_1 = var_21; [L217] SORT_1 var_62 = var_62_arg_0 == var_62_arg_1; [L218] SORT_5 var_58_arg_0 = var_52; [L219] var_58_arg_0 = var_58_arg_0 & mask_SORT_5 [L220] SORT_9 var_58 = var_58_arg_0; [L221] SORT_9 var_59_arg_0 = var_58; [L222] SORT_9 var_59_arg_1 = var_16; [L223] SORT_1 var_59 = var_59_arg_0 == var_59_arg_1; [L224] SORT_5 var_53_arg_0 = var_52; [L225] var_53_arg_0 = var_53_arg_0 & mask_SORT_5 [L226] SORT_9 var_53 = var_53_arg_0; [L227] SORT_9 var_54_arg_0 = var_53; [L228] SORT_9 var_54_arg_1 = var_11; [L229] SORT_1 var_54 = var_54_arg_0 == var_54_arg_1; [L230] SORT_1 var_55_arg_0 = var_54; [L231] SORT_46 var_55_arg_1 = state_50; [L232] SORT_46 var_55_arg_2 = state_48; [L233] SORT_46 var_55 = var_55_arg_0 ? var_55_arg_1 : var_55_arg_2; [L234] SORT_1 var_60_arg_0 = var_59; [L235] SORT_46 var_60_arg_1 = state_56; [L236] SORT_46 var_60_arg_2 = var_55; [L237] SORT_46 var_60 = var_60_arg_0 ? var_60_arg_1 : var_60_arg_2; [L238] SORT_1 var_63_arg_0 = var_62; [L239] SORT_46 var_63_arg_1 = state_56; [L240] SORT_46 var_63_arg_2 = var_60; [L241] SORT_46 var_63 = var_63_arg_0 ? var_63_arg_1 : var_63_arg_2; [L242] SORT_1 var_68_arg_0 = var_67; [L243] SORT_46 var_68_arg_1 = state_64; [L244] SORT_46 var_68_arg_2 = var_63; [L245] SORT_46 var_68 = var_68_arg_0 ? var_68_arg_1 : var_68_arg_2; [L246] SORT_1 var_73_arg_0 = var_72; [L247] SORT_46 var_73_arg_1 = state_69; [L248] SORT_46 var_73_arg_2 = var_68; [L249] SORT_46 var_73 = var_73_arg_0 ? var_73_arg_1 : var_73_arg_2; [L250] SORT_1 var_78_arg_0 = var_77; [L251] SORT_46 var_78_arg_1 = state_74; [L252] SORT_46 var_78_arg_2 = var_73; [L253] SORT_46 var_78 = var_78_arg_0 ? var_78_arg_1 : var_78_arg_2; [L254] SORT_1 var_84_arg_0 = var_83; [L255] SORT_46 var_84_arg_1 = state_80; [L256] SORT_46 var_84_arg_2 = var_78; [L257] SORT_46 var_84 = var_84_arg_0 ? var_84_arg_1 : var_84_arg_2; [L258] SORT_46 var_85_arg_0 = var_84; [L259] var_85_arg_0 = var_85_arg_0 & mask_SORT_46 [L260] SORT_9 var_85 = var_85_arg_0; [L261] SORT_9 var_86_arg_0 = var_85; [L262] SORT_9 var_86_arg_1 = var_40; [L263] SORT_1 var_86 = var_86_arg_0 == var_86_arg_1; [L264] SORT_1 var_87_arg_0 = var_45; [L265] SORT_1 var_87_arg_1 = var_86; [L266] SORT_1 var_87 = var_87_arg_0 & var_87_arg_1; [L267] SORT_1 var_88_arg_0 = var_87; [L268] SORT_1 var_88 = ~var_88_arg_0; [L269] SORT_3 var_89_arg_0 = var_42; [L270] SORT_5 var_89 = var_89_arg_0 >> 6; [L271] SORT_5 var_108_arg_0 = var_89; [L272] var_108_arg_0 = var_108_arg_0 & mask_SORT_5 [L273] SORT_9 var_108 = var_108_arg_0; [L274] SORT_9 var_109_arg_0 = var_108; [L275] SORT_9 var_109_arg_1 = var_40; [L276] SORT_1 var_109 = var_109_arg_0 == var_109_arg_1; [L277] SORT_5 var_105_arg_0 = var_89; [L278] var_105_arg_0 = var_105_arg_0 & mask_SORT_5 [L279] SORT_9 var_105 = var_105_arg_0; [L280] SORT_9 var_106_arg_0 = var_105; [L281] SORT_9 var_106_arg_1 = var_36; [L282] SORT_1 var_106 = var_106_arg_0 == var_106_arg_1; [L283] SORT_5 var_102_arg_0 = var_89; [L284] var_102_arg_0 = var_102_arg_0 & mask_SORT_5 [L285] SORT_9 var_102 = var_102_arg_0; [L286] SORT_9 var_103_arg_0 = var_102; [L287] SORT_9 var_103_arg_1 = var_31; [L288] SORT_1 var_103 = var_103_arg_0 == var_103_arg_1; [L289] SORT_5 var_99_arg_0 = var_89; [L290] var_99_arg_0 = var_99_arg_0 & mask_SORT_5 [L291] SORT_9 var_99 = var_99_arg_0; [L292] SORT_9 var_100_arg_0 = var_99; [L293] SORT_9 var_100_arg_1 = var_26; [L294] SORT_1 var_100 = var_100_arg_0 == var_100_arg_1; [L295] SORT_5 var_96_arg_0 = var_89; [L296] var_96_arg_0 = var_96_arg_0 & mask_SORT_5 [L297] SORT_9 var_96 = var_96_arg_0; [L298] SORT_9 var_97_arg_0 = var_96; [L299] SORT_9 var_97_arg_1 = var_21; [L300] SORT_1 var_97 = var_97_arg_0 == var_97_arg_1; [L301] SORT_5 var_93_arg_0 = var_89; [L302] var_93_arg_0 = var_93_arg_0 & mask_SORT_5 [L303] SORT_9 var_93 = var_93_arg_0; [L304] SORT_9 var_94_arg_0 = var_93; [L305] SORT_9 var_94_arg_1 = var_16; [L306] SORT_1 var_94 = var_94_arg_0 == var_94_arg_1; [L307] SORT_5 var_90_arg_0 = var_89; [L308] var_90_arg_0 = var_90_arg_0 & mask_SORT_5 [L309] SORT_9 var_90 = var_90_arg_0; [L310] SORT_9 var_91_arg_0 = var_90; [L311] SORT_9 var_91_arg_1 = var_11; [L312] SORT_1 var_91 = var_91_arg_0 == var_91_arg_1; [L313] SORT_1 var_92_arg_0 = var_91; [L314] SORT_46 var_92_arg_1 = state_50; [L315] SORT_46 var_92_arg_2 = state_48; [L316] SORT_46 var_92 = var_92_arg_0 ? var_92_arg_1 : var_92_arg_2; [L317] SORT_1 var_95_arg_0 = var_94; [L318] SORT_46 var_95_arg_1 = state_56; [L319] SORT_46 var_95_arg_2 = var_92; [L320] SORT_46 var_95 = var_95_arg_0 ? var_95_arg_1 : var_95_arg_2; [L321] SORT_1 var_98_arg_0 = var_97; [L322] SORT_46 var_98_arg_1 = state_56; [L323] SORT_46 var_98_arg_2 = var_95; [L324] SORT_46 var_98 = var_98_arg_0 ? var_98_arg_1 : var_98_arg_2; [L325] SORT_1 var_101_arg_0 = var_100; [L326] SORT_46 var_101_arg_1 = state_64; [L327] SORT_46 var_101_arg_2 = var_98; [L328] SORT_46 var_101 = var_101_arg_0 ? var_101_arg_1 : var_101_arg_2; [L329] SORT_1 var_104_arg_0 = var_103; [L330] SORT_46 var_104_arg_1 = state_69; [L331] SORT_46 var_104_arg_2 = var_101; [L332] SORT_46 var_104 = var_104_arg_0 ? var_104_arg_1 : var_104_arg_2; [L333] SORT_1 var_107_arg_0 = var_106; [L334] SORT_46 var_107_arg_1 = state_74; [L335] SORT_46 var_107_arg_2 = var_104; [L336] SORT_46 var_107 = var_107_arg_0 ? var_107_arg_1 : var_107_arg_2; [L337] SORT_1 var_110_arg_0 = var_109; [L338] SORT_46 var_110_arg_1 = state_80; [L339] SORT_46 var_110_arg_2 = var_107; [L340] SORT_46 var_110 = var_110_arg_0 ? var_110_arg_1 : var_110_arg_2; [L341] SORT_46 var_111_arg_0 = var_110; [L342] SORT_5 var_111 = var_111_arg_0 >> 0; [L343] var_111 = var_111 & mask_SORT_5 [L344] SORT_5 var_112_arg_0 = state_7; [L345] SORT_5 var_112_arg_1 = var_111; [L346] SORT_1 var_112 = var_112_arg_0 == var_112_arg_1; [L347] SORT_1 var_113_arg_0 = var_88; [L348] SORT_1 var_113_arg_1 = var_112; [L349] SORT_1 var_113 = var_113_arg_0 & var_113_arg_1; [L350] SORT_1 var_117_arg_0 = var_113; [L351] SORT_1 var_117 = ~var_117_arg_0; [L352] SORT_1 var_118_arg_0 = var_116; [L353] SORT_1 var_118_arg_1 = var_117; [L354] SORT_1 var_118 = var_118_arg_0 & var_118_arg_1; [L355] var_118 = var_118 & mask_SORT_1 [L356] SORT_1 bad_119_arg_0 = var_118; [L357] CALL __VERIFIER_assert(!(bad_119_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 1, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 5 NumberOfCodeBlocks, 5 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 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 08:26:10,941 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_958282b6-ffe3-4edf-90c9-afd3f3e53f1e/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