./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/forester-heap/sll-01-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/forester-heap/sll-01-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ba1a5c8c8cff607fde50280cfe0e0975858a4c6ed38f8443d26bb1773b66a31d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 06:32:15,082 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 06:32:15,138 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 06:32:15,144 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 06:32:15,145 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 06:32:15,176 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 06:32:15,177 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 06:32:15,177 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 06:32:15,178 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 06:32:15,178 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 06:32:15,179 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 06:32:15,180 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 06:32:15,181 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 06:32:15,184 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 06:32:15,185 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 06:32:15,185 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 06:32:15,185 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 06:32:15,186 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 06:32:15,186 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 06:32:15,186 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 06:32:15,187 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 06:32:15,187 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 06:32:15,189 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 06:32:15,190 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 06:32:15,190 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 06:32:15,190 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 06:32:15,190 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 06:32:15,191 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 06:32:15,191 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 06:32:15,191 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 06:32:15,192 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 06:32:15,192 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 06:32:15,192 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 06:32:15,192 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 06:32:15,192 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 06:32:15,193 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 06:32:15,193 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 06:32:15,193 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 06:32:15,193 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 06:32:15,194 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 06:32:15,194 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 06:32:15,195 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 06:32:15,195 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ba1a5c8c8cff607fde50280cfe0e0975858a4c6ed38f8443d26bb1773b66a31d [2024-11-16 06:32:15,480 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 06:32:15,502 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 06:32:15,505 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 06:32:15,506 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 06:32:15,507 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 06:32:15,508 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-01-1.i [2024-11-16 06:32:16,936 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 06:32:17,181 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 06:32:17,182 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i [2024-11-16 06:32:17,196 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ece4a8e7/50d8927e10ea4108b07db0723a08d2a6/FLAG7669ae98c [2024-11-16 06:32:17,215 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ece4a8e7/50d8927e10ea4108b07db0723a08d2a6 [2024-11-16 06:32:17,219 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 06:32:17,221 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 06:32:17,222 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 06:32:17,222 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 06:32:17,229 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 06:32:17,230 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:32:17" (1/1) ... [2024-11-16 06:32:17,231 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64bd1e63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:32:17, skipping insertion in model container [2024-11-16 06:32:17,231 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:32:17" (1/1) ... [2024-11-16 06:32:17,290 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 06:32:17,591 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[22034,22047] [2024-11-16 06:32:17,601 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[22307,22320] [2024-11-16 06:32:17,605 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[22516,22529] [2024-11-16 06:32:17,607 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[22586,22599] [2024-11-16 06:32:17,610 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[22853,22866] [2024-11-16 06:32:17,612 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[22961,22974] [2024-11-16 06:32:17,615 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23192,23205] [2024-11-16 06:32:17,617 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23272,23285] [2024-11-16 06:32:17,619 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23351,23364] [2024-11-16 06:32:17,621 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23441,23454] [2024-11-16 06:32:17,623 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23619,23632] [2024-11-16 06:32:17,623 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23697,23710] [2024-11-16 06:32:17,625 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23774,23787] [2024-11-16 06:32:17,629 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 06:32:17,641 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 06:32:17,673 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[22034,22047] [2024-11-16 06:32:17,675 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[22307,22320] [2024-11-16 06:32:17,677 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[22516,22529] [2024-11-16 06:32:17,677 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[22586,22599] [2024-11-16 06:32:17,679 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[22853,22866] [2024-11-16 06:32:17,680 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[22961,22974] [2024-11-16 06:32:17,682 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23192,23205] [2024-11-16 06:32:17,683 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23272,23285] [2024-11-16 06:32:17,683 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23351,23364] [2024-11-16 06:32:17,684 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23441,23454] [2024-11-16 06:32:17,686 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23619,23632] [2024-11-16 06:32:17,686 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23697,23710] [2024-11-16 06:32:17,687 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23774,23787] [2024-11-16 06:32:17,689 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 06:32:17,715 INFO L204 MainTranslator]: Completed translation [2024-11-16 06:32:17,715 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:32:17 WrapperNode [2024-11-16 06:32:17,715 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 06:32:17,716 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 06:32:17,716 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 06:32:17,716 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 06:32:17,721 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:32:17" (1/1) ... [2024-11-16 06:32:17,732 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:32:17" (1/1) ... [2024-11-16 06:32:17,753 INFO L138 Inliner]: procedures = 119, calls = 41, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 207 [2024-11-16 06:32:17,754 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 06:32:17,755 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 06:32:17,755 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 06:32:17,755 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 06:32:17,764 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:32:17" (1/1) ... [2024-11-16 06:32:17,765 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:32:17" (1/1) ... [2024-11-16 06:32:17,768 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:32:17" (1/1) ... [2024-11-16 06:32:17,791 INFO L175 MemorySlicer]: Split 31 memory accesses to 2 slices as follows [2, 29]. 94 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 11 writes are split as follows [0, 11]. [2024-11-16 06:32:17,791 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:32:17" (1/1) ... [2024-11-16 06:32:17,791 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:32:17" (1/1) ... [2024-11-16 06:32:17,799 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:32:17" (1/1) ... [2024-11-16 06:32:17,799 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:32:17" (1/1) ... [2024-11-16 06:32:17,801 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:32:17" (1/1) ... [2024-11-16 06:32:17,802 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:32:17" (1/1) ... [2024-11-16 06:32:17,804 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 06:32:17,805 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 06:32:17,805 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 06:32:17,805 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 06:32:17,806 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:32:17" (1/1) ... [2024-11-16 06:32:17,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 06:32:17,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 06:32:17,842 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 06:32:17,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 06:32:17,895 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-16 06:32:17,895 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 06:32:17,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-16 06:32:17,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-16 06:32:17,895 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-16 06:32:17,895 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-16 06:32:17,895 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-16 06:32:17,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 06:32:17,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-16 06:32:17,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 06:32:17,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 06:32:18,051 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 06:32:18,052 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 06:32:18,346 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-16 06:32:18,346 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 06:32:18,365 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 06:32:18,365 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 06:32:18,366 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:32:18 BoogieIcfgContainer [2024-11-16 06:32:18,366 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 06:32:18,368 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 06:32:18,368 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 06:32:18,371 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 06:32:18,372 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 06:32:17" (1/3) ... [2024-11-16 06:32:18,372 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7374df6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:32:18, skipping insertion in model container [2024-11-16 06:32:18,372 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:32:17" (2/3) ... [2024-11-16 06:32:18,373 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7374df6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:32:18, skipping insertion in model container [2024-11-16 06:32:18,373 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:32:18" (3/3) ... [2024-11-16 06:32:18,374 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-01-1.i [2024-11-16 06:32:18,388 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 06:32:18,389 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations. [2024-11-16 06:32:18,439 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 06:32:18,445 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;@71153bb6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 06:32:18,446 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2024-11-16 06:32:18,450 INFO L276 IsEmpty]: Start isEmpty. Operand has 106 states, 92 states have (on average 1.7173913043478262) internal successors, (158), 105 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:32:18,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-16 06:32:18,455 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:32:18,456 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-16 06:32:18,456 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-11-16 06:32:18,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:32:18,462 INFO L85 PathProgramCache]: Analyzing trace with hash 184148031, now seen corresponding path program 1 times [2024-11-16 06:32:18,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:32:18,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138917045] [2024-11-16 06:32:18,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:32:18,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:32:18,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:32:18,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 06:32:18,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:32:18,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138917045] [2024-11-16 06:32:18,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138917045] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 06:32:18,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 06:32:18,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 06:32:18,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021716422] [2024-11-16 06:32:18,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 06:32:18,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 06:32:18,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:32:18,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 06:32:18,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 06:32:18,722 INFO L87 Difference]: Start difference. First operand has 106 states, 92 states have (on average 1.7173913043478262) internal successors, (158), 105 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:32:18,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:32:18,800 INFO L93 Difference]: Finished difference Result 215 states and 331 transitions. [2024-11-16 06:32:18,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 06:32:18,803 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2024-11-16 06:32:18,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:32:18,812 INFO L225 Difference]: With dead ends: 215 [2024-11-16 06:32:18,812 INFO L226 Difference]: Without dead ends: 107 [2024-11-16 06:32:18,815 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 06:32:18,820 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 92 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 06:32:18,821 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 113 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 06:32:18,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-16 06:32:18,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 87. [2024-11-16 06:32:18,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 75 states have (on average 1.28) internal successors, (96), 86 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-11-16 06:32:18,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 96 transitions. [2024-11-16 06:32:18,872 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 96 transitions. Word has length 5 [2024-11-16 06:32:18,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:32:18,874 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 96 transitions. [2024-11-16 06:32:18,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:32:18,875 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 96 transitions. [2024-11-16 06:32:18,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-16 06:32:18,875 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:32:18,876 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:32:18,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 06:32:18,877 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-11-16 06:32:18,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:32:18,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1156224469, now seen corresponding path program 1 times [2024-11-16 06:32:18,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:32:18,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857188996] [2024-11-16 06:32:18,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:32:18,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:32:18,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:32:19,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 06:32:19,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:32:19,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857188996] [2024-11-16 06:32:19,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857188996] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 06:32:19,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 06:32:19,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 06:32:19,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885747149] [2024-11-16 06:32:19,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 06:32:19,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 06:32:19,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:32:19,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 06:32:19,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 06:32:19,166 INFO L87 Difference]: Start difference. First operand 87 states and 96 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-11-16 06:32:19,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:32:19,246 INFO L93 Difference]: Finished difference Result 88 states and 97 transitions. [2024-11-16 06:32:19,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 06:32:19,247 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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) Word has length 11 [2024-11-16 06:32:19,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:32:19,248 INFO L225 Difference]: With dead ends: 88 [2024-11-16 06:32:19,248 INFO L226 Difference]: Without dead ends: 86 [2024-11-16 06:32:19,249 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 06:32:19,250 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 0 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 06:32:19,250 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 249 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 06:32:19,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-16 06:32:19,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2024-11-16 06:32:19,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 74 states have (on average 1.2702702702702702) internal successors, (94), 84 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-11-16 06:32:19,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 94 transitions. [2024-11-16 06:32:19,265 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 94 transitions. Word has length 11 [2024-11-16 06:32:19,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:32:19,265 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 94 transitions. [2024-11-16 06:32:19,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-11-16 06:32:19,265 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 94 transitions. [2024-11-16 06:32:19,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-16 06:32:19,266 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:32:19,266 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:32:19,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 06:32:19,267 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-11-16 06:32:19,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:32:19,267 INFO L85 PathProgramCache]: Analyzing trace with hash -118031800, now seen corresponding path program 1 times [2024-11-16 06:32:19,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:32:19,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230905079] [2024-11-16 06:32:19,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:32:19,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:32:19,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:32:19,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 06:32:19,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:32:19,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230905079] [2024-11-16 06:32:19,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230905079] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 06:32:19,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 06:32:19,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 06:32:19,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073555578] [2024-11-16 06:32:19,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 06:32:19,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 06:32:19,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:32:19,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 06:32:19,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 06:32:19,343 INFO L87 Difference]: Start difference. First operand 85 states and 94 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:32:19,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:32:19,412 INFO L93 Difference]: Finished difference Result 88 states and 98 transitions. [2024-11-16 06:32:19,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 06:32:19,412 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2024-11-16 06:32:19,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:32:19,416 INFO L225 Difference]: With dead ends: 88 [2024-11-16 06:32:19,416 INFO L226 Difference]: Without dead ends: 84 [2024-11-16 06:32:19,416 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 06:32:19,417 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 17 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 06:32:19,418 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 144 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 06:32:19,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-16 06:32:19,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2024-11-16 06:32:19,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 72 states have (on average 1.25) internal successors, (90), 80 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-11-16 06:32:19,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2024-11-16 06:32:19,427 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 17 [2024-11-16 06:32:19,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:32:19,428 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2024-11-16 06:32:19,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:32:19,428 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2024-11-16 06:32:19,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-16 06:32:19,432 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:32:19,432 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:32:19,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 06:32:19,432 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-11-16 06:32:19,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:32:19,433 INFO L85 PathProgramCache]: Analyzing trace with hash 633180244, now seen corresponding path program 1 times [2024-11-16 06:32:19,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:32:19,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398220059] [2024-11-16 06:32:19,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:32:19,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:32:19,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:32:19,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 06:32:19,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:32:19,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398220059] [2024-11-16 06:32:19,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398220059] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 06:32:19,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 06:32:19,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 06:32:19,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030712312] [2024-11-16 06:32:19,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 06:32:19,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 06:32:19,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:32:19,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 06:32:19,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 06:32:19,511 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:32:19,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:32:19,614 INFO L93 Difference]: Finished difference Result 148 states and 162 transitions. [2024-11-16 06:32:19,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 06:32:19,614 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2024-11-16 06:32:19,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:32:19,616 INFO L225 Difference]: With dead ends: 148 [2024-11-16 06:32:19,616 INFO L226 Difference]: Without dead ends: 126 [2024-11-16 06:32:19,616 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 06:32:19,618 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 150 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 06:32:19,619 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 135 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 06:32:19,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-16 06:32:19,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 81. [2024-11-16 06:32:19,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 73 states have (on average 1.2328767123287672) internal successors, (90), 80 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-11-16 06:32:19,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2024-11-16 06:32:19,632 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 18 [2024-11-16 06:32:19,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:32:19,633 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2024-11-16 06:32:19,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:32:19,633 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2024-11-16 06:32:19,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-16 06:32:19,634 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:32:19,634 INFO L215 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] [2024-11-16 06:32:19,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 06:32:19,634 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-11-16 06:32:19,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:32:19,635 INFO L85 PathProgramCache]: Analyzing trace with hash -674922493, now seen corresponding path program 1 times [2024-11-16 06:32:19,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:32:19,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172533030] [2024-11-16 06:32:19,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:32:19,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:32:19,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:32:19,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 06:32:19,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:32:19,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172533030] [2024-11-16 06:32:19,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172533030] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 06:32:19,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 06:32:19,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 06:32:19,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893795613] [2024-11-16 06:32:19,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 06:32:19,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 06:32:19,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:32:19,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 06:32:19,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 06:32:19,694 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:32:19,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:32:19,712 INFO L93 Difference]: Finished difference Result 135 states and 151 transitions. [2024-11-16 06:32:19,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 06:32:19,712 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2024-11-16 06:32:19,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:32:19,713 INFO L225 Difference]: With dead ends: 135 [2024-11-16 06:32:19,713 INFO L226 Difference]: Without dead ends: 88 [2024-11-16 06:32:19,714 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 06:32:19,716 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 3 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 06:32:19,718 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 167 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 06:32:19,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-16 06:32:19,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2024-11-16 06:32:19,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 78 states have (on average 1.2307692307692308) internal successors, (96), 85 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-11-16 06:32:19,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 96 transitions. [2024-11-16 06:32:19,729 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 96 transitions. Word has length 25 [2024-11-16 06:32:19,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:32:19,730 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 96 transitions. [2024-11-16 06:32:19,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:32:19,732 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 96 transitions. [2024-11-16 06:32:19,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-16 06:32:19,732 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:32:19,732 INFO L215 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] [2024-11-16 06:32:19,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 06:32:19,733 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-11-16 06:32:19,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:32:19,734 INFO L85 PathProgramCache]: Analyzing trace with hash 554086250, now seen corresponding path program 1 times [2024-11-16 06:32:19,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:32:19,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270524201] [2024-11-16 06:32:19,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:32:19,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:32:19,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:32:19,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 06:32:19,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:32:19,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270524201] [2024-11-16 06:32:19,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270524201] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 06:32:19,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 06:32:19,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 06:32:19,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514764290] [2024-11-16 06:32:19,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 06:32:19,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 06:32:19,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:32:19,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 06:32:19,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 06:32:19,783 INFO L87 Difference]: Start difference. First operand 86 states and 96 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:32:19,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:32:19,800 INFO L93 Difference]: Finished difference Result 86 states and 96 transitions. [2024-11-16 06:32:19,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 06:32:19,800 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2024-11-16 06:32:19,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:32:19,801 INFO L225 Difference]: With dead ends: 86 [2024-11-16 06:32:19,801 INFO L226 Difference]: Without dead ends: 84 [2024-11-16 06:32:19,802 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 06:32:19,803 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 13 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 06:32:19,803 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 147 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 06:32:19,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-16 06:32:19,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-16 06:32:19,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 77 states have (on average 1.2207792207792207) internal successors, (94), 83 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-11-16 06:32:19,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 94 transitions. [2024-11-16 06:32:19,810 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 94 transitions. Word has length 26 [2024-11-16 06:32:19,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:32:19,810 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 94 transitions. [2024-11-16 06:32:19,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:32:19,811 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 94 transitions. [2024-11-16 06:32:19,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-16 06:32:19,811 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:32:19,811 INFO L215 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] [2024-11-16 06:32:19,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 06:32:19,812 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-11-16 06:32:19,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:32:19,812 INFO L85 PathProgramCache]: Analyzing trace with hash 138803660, now seen corresponding path program 1 times [2024-11-16 06:32:19,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:32:19,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106900696] [2024-11-16 06:32:19,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:32:19,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:32:19,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:32:20,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 06:32:20,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:32:20,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106900696] [2024-11-16 06:32:20,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106900696] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 06:32:20,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 06:32:20,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 06:32:20,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339975131] [2024-11-16 06:32:20,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 06:32:20,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 06:32:20,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:32:20,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 06:32:20,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 06:32:20,028 INFO L87 Difference]: Start difference. First operand 84 states and 94 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:32:20,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:32:20,093 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2024-11-16 06:32:20,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 06:32:20,093 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2024-11-16 06:32:20,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:32:20,094 INFO L225 Difference]: With dead ends: 85 [2024-11-16 06:32:20,094 INFO L226 Difference]: Without dead ends: 83 [2024-11-16 06:32:20,095 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 06:32:20,095 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 1 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 06:32:20,095 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 134 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 06:32:20,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-16 06:32:20,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2024-11-16 06:32:20,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 76 states have (on average 1.2105263157894737) internal successors, (92), 81 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-11-16 06:32:20,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2024-11-16 06:32:20,113 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 26 [2024-11-16 06:32:20,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:32:20,113 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2024-11-16 06:32:20,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:32:20,113 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2024-11-16 06:32:20,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-16 06:32:20,114 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:32:20,114 INFO L215 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] [2024-11-16 06:32:20,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 06:32:20,115 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-11-16 06:32:20,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:32:20,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1225026045, now seen corresponding path program 1 times [2024-11-16 06:32:20,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:32:20,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036663525] [2024-11-16 06:32:20,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:32:20,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:32:20,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:32:20,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 06:32:20,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:32:20,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036663525] [2024-11-16 06:32:20,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036663525] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 06:32:20,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 06:32:20,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 06:32:20,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660194518] [2024-11-16 06:32:20,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 06:32:20,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 06:32:20,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:32:20,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 06:32:20,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-16 06:32:20,403 INFO L87 Difference]: Start difference. First operand 82 states and 92 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:32:20,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:32:20,660 INFO L93 Difference]: Finished difference Result 236 states and 263 transitions. [2024-11-16 06:32:20,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 06:32:20,661 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2024-11-16 06:32:20,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:32:20,662 INFO L225 Difference]: With dead ends: 236 [2024-11-16 06:32:20,662 INFO L226 Difference]: Without dead ends: 186 [2024-11-16 06:32:20,662 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-11-16 06:32:20,663 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 204 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 06:32:20,663 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 382 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 06:32:20,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-16 06:32:20,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 111. [2024-11-16 06:32:20,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 105 states have (on average 1.2) internal successors, (126), 110 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:32:20,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 126 transitions. [2024-11-16 06:32:20,682 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 126 transitions. Word has length 29 [2024-11-16 06:32:20,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:32:20,684 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 126 transitions. [2024-11-16 06:32:20,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:32:20,684 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 126 transitions. [2024-11-16 06:32:20,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-16 06:32:20,685 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:32:20,685 INFO L215 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] [2024-11-16 06:32:20,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 06:32:20,686 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-11-16 06:32:20,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:32:20,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1613825857, now seen corresponding path program 1 times [2024-11-16 06:32:20,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:32:20,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652679513] [2024-11-16 06:32:20,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:32:20,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:32:20,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:32:21,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 06:32:21,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:32:21,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652679513] [2024-11-16 06:32:21,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652679513] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 06:32:21,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 06:32:21,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 06:32:21,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736647525] [2024-11-16 06:32:21,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 06:32:21,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 06:32:21,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:32:21,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 06:32:21,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-16 06:32:21,597 INFO L87 Difference]: Start difference. First operand 111 states and 126 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:32:21,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:32:21,957 INFO L93 Difference]: Finished difference Result 245 states and 271 transitions. [2024-11-16 06:32:21,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 06:32:21,958 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2024-11-16 06:32:21,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:32:21,961 INFO L225 Difference]: With dead ends: 245 [2024-11-16 06:32:21,961 INFO L226 Difference]: Without dead ends: 243 [2024-11-16 06:32:21,962 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-11-16 06:32:21,964 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 219 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 06:32:21,965 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 473 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 06:32:21,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2024-11-16 06:32:21,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 127. [2024-11-16 06:32:21,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 121 states have (on average 1.1900826446280992) internal successors, (144), 126 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:32:21,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 144 transitions. [2024-11-16 06:32:21,989 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 144 transitions. Word has length 29 [2024-11-16 06:32:21,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:32:21,990 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 144 transitions. [2024-11-16 06:32:21,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:32:21,990 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 144 transitions. [2024-11-16 06:32:21,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-16 06:32:21,994 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:32:21,994 INFO L215 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] [2024-11-16 06:32:21,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 06:32:21,994 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-11-16 06:32:21,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:32:21,995 INFO L85 PathProgramCache]: Analyzing trace with hash 378667423, now seen corresponding path program 1 times [2024-11-16 06:32:21,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:32:21,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206239365] [2024-11-16 06:32:21,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:32:21,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:32:22,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:32:22,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 06:32:22,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:32:22,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206239365] [2024-11-16 06:32:22,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206239365] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 06:32:22,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 06:32:22,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 06:32:22,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893803904] [2024-11-16 06:32:22,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 06:32:22,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 06:32:22,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:32:22,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 06:32:22,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-16 06:32:22,574 INFO L87 Difference]: Start difference. First operand 127 states and 144 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:32:22,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:32:22,944 INFO L93 Difference]: Finished difference Result 243 states and 269 transitions. [2024-11-16 06:32:22,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 06:32:22,945 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2024-11-16 06:32:22,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:32:22,947 INFO L225 Difference]: With dead ends: 243 [2024-11-16 06:32:22,947 INFO L226 Difference]: Without dead ends: 241 [2024-11-16 06:32:22,948 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-11-16 06:32:22,949 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 208 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 06:32:22,950 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 481 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 06:32:22,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2024-11-16 06:32:22,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 130. [2024-11-16 06:32:22,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 124 states have (on average 1.185483870967742) internal successors, (147), 129 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:32:22,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 147 transitions. [2024-11-16 06:32:22,970 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 147 transitions. Word has length 32 [2024-11-16 06:32:22,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:32:22,971 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 147 transitions. [2024-11-16 06:32:22,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:32:22,971 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 147 transitions. [2024-11-16 06:32:22,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-16 06:32:22,972 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:32:22,972 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:32:22,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 06:32:22,972 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-11-16 06:32:22,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:32:22,974 INFO L85 PathProgramCache]: Analyzing trace with hash 578863171, now seen corresponding path program 1 times [2024-11-16 06:32:22,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:32:22,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038980503] [2024-11-16 06:32:22,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:32:22,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:32:22,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:32:23,059 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-16 06:32:23,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:32:23,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038980503] [2024-11-16 06:32:23,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038980503] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 06:32:23,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 06:32:23,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 06:32:23,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561814502] [2024-11-16 06:32:23,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 06:32:23,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 06:32:23,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:32:23,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 06:32:23,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 06:32:23,062 INFO L87 Difference]: Start difference. First operand 130 states and 147 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:32:23,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:32:23,168 INFO L93 Difference]: Finished difference Result 192 states and 215 transitions. [2024-11-16 06:32:23,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 06:32:23,169 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 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 34 [2024-11-16 06:32:23,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:32:23,170 INFO L225 Difference]: With dead ends: 192 [2024-11-16 06:32:23,170 INFO L226 Difference]: Without dead ends: 172 [2024-11-16 06:32:23,170 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-16 06:32:23,171 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 47 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 06:32:23,171 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 216 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 06:32:23,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-11-16 06:32:23,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 165. [2024-11-16 06:32:23,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 159 states have (on average 1.1886792452830188) internal successors, (189), 164 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:32:23,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 189 transitions. [2024-11-16 06:32:23,202 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 189 transitions. Word has length 34 [2024-11-16 06:32:23,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:32:23,202 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 189 transitions. [2024-11-16 06:32:23,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:32:23,202 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 189 transitions. [2024-11-16 06:32:23,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-16 06:32:23,205 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:32:23,206 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:32:23,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 06:32:23,206 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-11-16 06:32:23,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:32:23,207 INFO L85 PathProgramCache]: Analyzing trace with hash 355146433, now seen corresponding path program 1 times [2024-11-16 06:32:23,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:32:23,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377750023] [2024-11-16 06:32:23,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:32:23,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:32:23,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:32:23,257 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-16 06:32:23,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:32:23,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377750023] [2024-11-16 06:32:23,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377750023] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 06:32:23,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 06:32:23,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 06:32:23,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737490271] [2024-11-16 06:32:23,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 06:32:23,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 06:32:23,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:32:23,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 06:32:23,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 06:32:23,260 INFO L87 Difference]: Start difference. First operand 165 states and 189 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:32:23,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:32:23,319 INFO L93 Difference]: Finished difference Result 165 states and 189 transitions. [2024-11-16 06:32:23,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 06:32:23,319 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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 34 [2024-11-16 06:32:23,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:32:23,320 INFO L225 Difference]: With dead ends: 165 [2024-11-16 06:32:23,320 INFO L226 Difference]: Without dead ends: 163 [2024-11-16 06:32:23,321 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 06:32:23,321 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 55 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 06:32:23,322 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 91 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 06:32:23,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-11-16 06:32:23,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2024-11-16 06:32:23,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 158 states have (on average 1.1835443037974684) internal successors, (187), 162 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:32:23,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 187 transitions. [2024-11-16 06:32:23,344 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 187 transitions. Word has length 34 [2024-11-16 06:32:23,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:32:23,345 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 187 transitions. [2024-11-16 06:32:23,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:32:23,345 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 187 transitions. [2024-11-16 06:32:23,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-16 06:32:23,346 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:32:23,346 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:32:23,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-16 06:32:23,346 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-11-16 06:32:23,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:32:23,347 INFO L85 PathProgramCache]: Analyzing trace with hash 913792962, now seen corresponding path program 1 times [2024-11-16 06:32:23,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:32:23,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743033635] [2024-11-16 06:32:23,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:32:23,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:32:23,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:32:23,524 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 06:32:23,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:32:23,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743033635] [2024-11-16 06:32:23,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743033635] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 06:32:23,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [594052055] [2024-11-16 06:32:23,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:32:23,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:32:23,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 06:32:23,527 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 06:32:23,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-16 06:32:23,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:32:23,629 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-16 06:32:23,643 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 06:32:23,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-16 06:32:23,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-16 06:32:23,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-16 06:32:23,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-16 06:32:24,006 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 06:32:24,010 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 06:32:24,151 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 06:32:24,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [594052055] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 06:32:24,152 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 06:32:24,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 5] total 8 [2024-11-16 06:32:24,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388161893] [2024-11-16 06:32:24,153 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 06:32:24,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 06:32:24,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:32:24,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 06:32:24,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-16 06:32:24,155 INFO L87 Difference]: Start difference. First operand 163 states and 187 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:32:24,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:32:24,383 INFO L93 Difference]: Finished difference Result 288 states and 324 transitions. [2024-11-16 06:32:24,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 06:32:24,384 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-16 06:32:24,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:32:24,385 INFO L225 Difference]: With dead ends: 288 [2024-11-16 06:32:24,385 INFO L226 Difference]: Without dead ends: 213 [2024-11-16 06:32:24,386 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-11-16 06:32:24,386 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 204 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 06:32:24,386 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 286 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 06:32:24,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-11-16 06:32:24,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 166. [2024-11-16 06:32:24,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 161 states have (on average 1.1677018633540373) internal successors, (188), 165 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:32:24,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 188 transitions. [2024-11-16 06:32:24,426 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 188 transitions. Word has length 37 [2024-11-16 06:32:24,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:32:24,426 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 188 transitions. [2024-11-16 06:32:24,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:32:24,427 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 188 transitions. [2024-11-16 06:32:24,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-16 06:32:24,427 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:32:24,427 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:32:24,446 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-16 06:32:24,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-16 06:32:24,629 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-11-16 06:32:24,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:32:24,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1663760600, now seen corresponding path program 1 times [2024-11-16 06:32:24,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:32:24,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242693648] [2024-11-16 06:32:24,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:32:24,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:32:24,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:32:24,921 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 06:32:24,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:32:24,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242693648] [2024-11-16 06:32:24,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242693648] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 06:32:24,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [218819834] [2024-11-16 06:32:24,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:32:24,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:32:24,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 06:32:24,925 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 06:32:24,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-16 06:32:25,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:32:25,025 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-16 06:32:25,028 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 06:32:25,301 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 06:32:25,302 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 06:32:25,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [218819834] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 06:32:25,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 06:32:25,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 14 [2024-11-16 06:32:25,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778859830] [2024-11-16 06:32:25,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 06:32:25,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 06:32:25,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:32:25,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 06:32:25,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2024-11-16 06:32:25,304 INFO L87 Difference]: Start difference. First operand 166 states and 188 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:32:25,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:32:25,592 INFO L93 Difference]: Finished difference Result 270 states and 295 transitions. [2024-11-16 06:32:25,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 06:32:25,593 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-16 06:32:25,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:32:25,594 INFO L225 Difference]: With dead ends: 270 [2024-11-16 06:32:25,594 INFO L226 Difference]: Without dead ends: 229 [2024-11-16 06:32:25,595 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2024-11-16 06:32:25,595 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 167 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 06:32:25,595 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 425 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 06:32:25,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-11-16 06:32:25,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 169. [2024-11-16 06:32:25,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 164 states have (on average 1.1585365853658536) internal successors, (190), 168 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:32:25,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 190 transitions. [2024-11-16 06:32:25,619 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 190 transitions. Word has length 37 [2024-11-16 06:32:25,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:32:25,619 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 190 transitions. [2024-11-16 06:32:25,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:32:25,620 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 190 transitions. [2024-11-16 06:32:25,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-16 06:32:25,621 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:32:25,621 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:32:25,639 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-16 06:32:25,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-16 06:32:25,826 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-11-16 06:32:25,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:32:25,826 INFO L85 PathProgramCache]: Analyzing trace with hash 277822521, now seen corresponding path program 1 times [2024-11-16 06:32:25,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:32:25,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001462117] [2024-11-16 06:32:25,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:32:25,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:32:25,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:32:25,865 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 06:32:25,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:32:25,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001462117] [2024-11-16 06:32:25,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001462117] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 06:32:25,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 06:32:25,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 06:32:25,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213794341] [2024-11-16 06:32:25,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 06:32:25,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 06:32:25,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:32:25,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 06:32:25,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 06:32:25,867 INFO L87 Difference]: Start difference. First operand 169 states and 190 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:32:25,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:32:25,906 INFO L93 Difference]: Finished difference Result 274 states and 313 transitions. [2024-11-16 06:32:25,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 06:32:25,907 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-11-16 06:32:25,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:32:25,908 INFO L225 Difference]: With dead ends: 274 [2024-11-16 06:32:25,908 INFO L226 Difference]: Without dead ends: 207 [2024-11-16 06:32:25,909 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 06:32:25,910 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 7 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 06:32:25,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 166 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 06:32:25,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2024-11-16 06:32:25,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 197. [2024-11-16 06:32:25,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 192 states have (on average 1.1666666666666667) internal successors, (224), 196 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:32:25,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 224 transitions. [2024-11-16 06:32:25,939 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 224 transitions. Word has length 38 [2024-11-16 06:32:25,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:32:25,939 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 224 transitions. [2024-11-16 06:32:25,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:32:25,940 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 224 transitions. [2024-11-16 06:32:25,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-16 06:32:25,940 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:32:25,940 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:32:25,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-16 06:32:25,941 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-11-16 06:32:25,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:32:25,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1689250891, now seen corresponding path program 1 times [2024-11-16 06:32:25,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:32:25,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522192690] [2024-11-16 06:32:25,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:32:25,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:32:25,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:32:26,066 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 06:32:26,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:32:26,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522192690] [2024-11-16 06:32:26,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522192690] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 06:32:26,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2144999987] [2024-11-16 06:32:26,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:32:26,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:32:26,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 06:32:26,069 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 06:32:26,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-16 06:32:26,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:32:26,178 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-16 06:32:26,183 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 06:32:26,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-16 06:32:26,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-16 06:32:26,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-16 06:32:26,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-11-16 06:32:26,400 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-16 06:32:26,400 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 06:32:26,509 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-16 06:32:26,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2144999987] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 06:32:26,512 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 06:32:26,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 4] total 7 [2024-11-16 06:32:26,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429322283] [2024-11-16 06:32:26,512 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 06:32:26,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 06:32:26,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:32:26,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 06:32:26,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-16 06:32:26,514 INFO L87 Difference]: Start difference. First operand 197 states and 224 transitions. Second operand has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 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-11-16 06:32:26,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:32:26,789 INFO L93 Difference]: Finished difference Result 348 states and 388 transitions. [2024-11-16 06:32:26,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-16 06:32:26,789 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 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 41 [2024-11-16 06:32:26,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:32:26,791 INFO L225 Difference]: With dead ends: 348 [2024-11-16 06:32:26,791 INFO L226 Difference]: Without dead ends: 290 [2024-11-16 06:32:26,791 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-16 06:32:26,792 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 103 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 06:32:26,792 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 430 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 06:32:26,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2024-11-16 06:32:26,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 223. [2024-11-16 06:32:26,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 218 states have (on average 1.1926605504587156) internal successors, (260), 222 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:32:26,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 260 transitions. [2024-11-16 06:32:26,823 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 260 transitions. Word has length 41 [2024-11-16 06:32:26,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:32:26,823 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 260 transitions. [2024-11-16 06:32:26,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 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-11-16 06:32:26,823 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 260 transitions. [2024-11-16 06:32:26,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-16 06:32:26,824 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:32:26,824 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:32:26,841 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-16 06:32:27,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:32:27,025 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-11-16 06:32:27,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:32:27,025 INFO L85 PathProgramCache]: Analyzing trace with hash -2039523724, now seen corresponding path program 1 times [2024-11-16 06:32:27,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:32:27,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505199355] [2024-11-16 06:32:27,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:32:27,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:32:27,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:32:27,120 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 06:32:27,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:32:27,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505199355] [2024-11-16 06:32:27,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505199355] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 06:32:27,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 06:32:27,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 06:32:27,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320003628] [2024-11-16 06:32:27,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 06:32:27,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 06:32:27,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:32:27,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 06:32:27,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 06:32:27,123 INFO L87 Difference]: Start difference. First operand 223 states and 260 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:32:27,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:32:27,214 INFO L93 Difference]: Finished difference Result 305 states and 352 transitions. [2024-11-16 06:32:27,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 06:32:27,215 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2024-11-16 06:32:27,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:32:27,216 INFO L225 Difference]: With dead ends: 305 [2024-11-16 06:32:27,216 INFO L226 Difference]: Without dead ends: 165 [2024-11-16 06:32:27,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 06:32:27,217 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 2 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 06:32:27,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 250 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 06:32:27,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-16 06:32:27,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 163. [2024-11-16 06:32:27,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 159 states have (on average 1.1383647798742138) internal successors, (181), 162 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:32:27,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 181 transitions. [2024-11-16 06:32:27,236 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 181 transitions. Word has length 42 [2024-11-16 06:32:27,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:32:27,236 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 181 transitions. [2024-11-16 06:32:27,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:32:27,236 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 181 transitions. [2024-11-16 06:32:27,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-16 06:32:27,237 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:32:27,237 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:32:27,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-16 06:32:27,237 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-11-16 06:32:27,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:32:27,238 INFO L85 PathProgramCache]: Analyzing trace with hash -398214064, now seen corresponding path program 1 times [2024-11-16 06:32:27,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:32:27,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927852329] [2024-11-16 06:32:27,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:32:27,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:32:27,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:32:27,446 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 06:32:27,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:32:27,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927852329] [2024-11-16 06:32:27,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927852329] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 06:32:27,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 06:32:27,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 06:32:27,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528419174] [2024-11-16 06:32:27,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 06:32:27,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 06:32:27,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:32:27,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 06:32:27,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 06:32:27,448 INFO L87 Difference]: Start difference. First operand 163 states and 181 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:32:27,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:32:27,552 INFO L93 Difference]: Finished difference Result 267 states and 298 transitions. [2024-11-16 06:32:27,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 06:32:27,553 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2024-11-16 06:32:27,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:32:27,554 INFO L225 Difference]: With dead ends: 267 [2024-11-16 06:32:27,554 INFO L226 Difference]: Without dead ends: 172 [2024-11-16 06:32:27,554 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-16 06:32:27,555 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 21 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 06:32:27,555 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 246 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 06:32:27,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-11-16 06:32:27,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 165. [2024-11-16 06:32:27,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 161 states have (on average 1.1366459627329193) internal successors, (183), 164 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:32:27,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 183 transitions. [2024-11-16 06:32:27,589 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 183 transitions. Word has length 43 [2024-11-16 06:32:27,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:32:27,589 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 183 transitions. [2024-11-16 06:32:27,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:32:27,589 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 183 transitions. [2024-11-16 06:32:27,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-16 06:32:27,590 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:32:27,590 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:32:27,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-16 06:32:27,590 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-11-16 06:32:27,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:32:27,591 INFO L85 PathProgramCache]: Analyzing trace with hash -807038289, now seen corresponding path program 1 times [2024-11-16 06:32:27,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:32:27,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8189806] [2024-11-16 06:32:27,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:32:27,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:32:27,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:32:28,313 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 06:32:28,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:32:28,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8189806] [2024-11-16 06:32:28,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8189806] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 06:32:28,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [898454185] [2024-11-16 06:32:28,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:32:28,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:32:28,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 06:32:28,316 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 06:32:28,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-16 06:32:28,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:32:28,446 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-16 06:32:28,450 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 06:32:28,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-16 06:32:28,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-16 06:32:28,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-16 06:32:28,633 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-16 06:32:28,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-16 06:32:28,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:32:28,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2024-11-16 06:32:28,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:32:28,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2024-11-16 06:32:28,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-16 06:32:28,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-16 06:32:28,935 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-16 06:32:28,936 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-16 06:32:28,946 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-16 06:32:28,954 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-16 06:32:28,957 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-16 06:32:28,974 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-16 06:32:28,976 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-16 06:32:28,976 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-16 06:32:28,979 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-16 06:32:28,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:32:28,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:32:28,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:32:28,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:32:28,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:32:28,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:32:28,998 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-16 06:32:28,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 552 treesize of output 405 [2024-11-16 06:32:29,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:32:29,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:32:29,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:32:29,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 111 [2024-11-16 06:32:29,045 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-16 06:32:29,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 30 [2024-11-16 06:32:29,616 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 06:32:29,616 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 06:32:30,118 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 06:32:30,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 495 treesize of output 474 [2024-11-16 06:32:30,194 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 06:32:30,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 523 treesize of output 522 [2024-11-16 06:32:30,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:32:30,247 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-16 06:32:30,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 4 [2024-11-16 06:32:30,328 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2024-11-16 06:32:30,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2024-11-16 06:32:45,349 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-16 06:32:45,362 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 06:32:45,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 277 treesize of output 218 [2024-11-16 06:32:45,376 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-16 06:32:45,388 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 06:32:45,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 199 treesize of output 166 [2024-11-16 06:32:45,396 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-16 06:32:45,397 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-16 06:32:45,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:32:45,432 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 06:32:45,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2992 treesize of output 2696 [2024-11-16 06:32:45,467 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 06:32:45,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 115 treesize of output 115 [2024-11-16 06:32:45,487 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-16 06:32:45,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 174 treesize of output 168 [2024-11-16 06:32:45,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 84 [2024-11-16 06:32:45,534 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-16 06:32:45,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2024-11-16 06:32:45,547 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-16 06:32:45,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 104 [2024-11-16 06:32:45,620 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-16 06:32:45,632 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 06:32:45,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 277 treesize of output 270 [2024-11-16 06:32:45,639 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-16 06:32:45,648 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 06:32:45,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 251 treesize of output 166 [2024-11-16 06:32:45,654 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-16 06:32:45,657 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-16 06:32:45,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 132 [2024-11-16 06:32:45,662 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-16 06:32:45,674 INFO L349 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2024-11-16 06:32:45,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 432 treesize of output 381 [2024-11-16 06:32:45,686 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 06:32:45,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 46 [2024-11-16 06:32:45,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-16 06:32:45,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-16 06:32:49,976 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 06:32:49,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [898454185] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 06:32:49,977 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 06:32:49,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 23 [2024-11-16 06:32:49,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304313616] [2024-11-16 06:32:49,978 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 06:32:49,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-16 06:32:49,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:32:49,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-16 06:32:49,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=396, Unknown=6, NotChecked=0, Total=506 [2024-11-16 06:32:49,981 INFO L87 Difference]: Start difference. First operand 165 states and 183 transitions. Second operand has 23 states, 23 states have (on average 4.739130434782608) internal successors, (109), 23 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:32:58,847 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-16 06:33:00,269 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-16 06:33:04,611 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-16 06:33:08,615 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-16 06:33:08,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:33:08,755 INFO L93 Difference]: Finished difference Result 492 states and 540 transitions. [2024-11-16 06:33:08,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-16 06:33:08,756 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 4.739130434782608) internal successors, (109), 23 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2024-11-16 06:33:08,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:33:08,758 INFO L225 Difference]: With dead ends: 492 [2024-11-16 06:33:08,758 INFO L226 Difference]: Without dead ends: 419 [2024-11-16 06:33:08,759 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 24.2s TimeCoverageRelationStatistics Valid=338, Invalid=915, Unknown=7, NotChecked=0, Total=1260 [2024-11-16 06:33:08,761 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 1390 mSDsluCounter, 924 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 49 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1390 SdHoareTripleChecker+Valid, 1024 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.4s IncrementalHoareTripleChecker+Time [2024-11-16 06:33:08,761 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1390 Valid, 1024 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 523 Invalid, 2 Unknown, 0 Unchecked, 13.4s Time] [2024-11-16 06:33:08,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2024-11-16 06:33:08,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 186. [2024-11-16 06:33:08,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 182 states have (on average 1.1373626373626373) internal successors, (207), 185 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:33:08,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 207 transitions. [2024-11-16 06:33:08,805 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 207 transitions. Word has length 43 [2024-11-16 06:33:08,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:33:08,806 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 207 transitions. [2024-11-16 06:33:08,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.739130434782608) internal successors, (109), 23 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:33:08,806 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 207 transitions. [2024-11-16 06:33:08,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-16 06:33:08,807 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:33:08,807 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:33:08,824 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-16 06:33:09,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:33:09,012 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-11-16 06:33:09,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:33:09,012 INFO L85 PathProgramCache]: Analyzing trace with hash -477272528, now seen corresponding path program 1 times [2024-11-16 06:33:09,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:33:09,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329735478] [2024-11-16 06:33:09,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:33:09,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:33:09,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:33:09,189 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-16 06:33:09,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:33:09,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329735478] [2024-11-16 06:33:09,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329735478] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 06:33:09,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 06:33:09,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 06:33:09,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346851807] [2024-11-16 06:33:09,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 06:33:09,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 06:33:09,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:33:09,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 06:33:09,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 06:33:09,193 INFO L87 Difference]: Start difference. First operand 186 states and 207 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:33:09,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:33:09,374 INFO L93 Difference]: Finished difference Result 331 states and 364 transitions. [2024-11-16 06:33:09,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 06:33:09,374 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2024-11-16 06:33:09,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:33:09,375 INFO L225 Difference]: With dead ends: 331 [2024-11-16 06:33:09,375 INFO L226 Difference]: Without dead ends: 209 [2024-11-16 06:33:09,376 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-16 06:33:09,376 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 161 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 06:33:09,376 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 207 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 06:33:09,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-11-16 06:33:09,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 167. [2024-11-16 06:33:09,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 163 states have (on average 1.1288343558282208) internal successors, (184), 166 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:33:09,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 184 transitions. [2024-11-16 06:33:09,404 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 184 transitions. Word has length 43 [2024-11-16 06:33:09,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:33:09,405 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 184 transitions. [2024-11-16 06:33:09,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:33:09,405 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 184 transitions. [2024-11-16 06:33:09,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-16 06:33:09,405 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:33:09,405 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:33:09,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-16 06:33:09,406 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-11-16 06:33:09,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:33:09,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1248208369, now seen corresponding path program 1 times [2024-11-16 06:33:09,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:33:09,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614833624] [2024-11-16 06:33:09,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:33:09,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:33:09,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:33:10,744 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 06:33:10,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:33:10,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614833624] [2024-11-16 06:33:10,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614833624] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 06:33:10,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [45092709] [2024-11-16 06:33:10,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:33:10,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:33:10,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 06:33:10,746 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 06:33:10,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-16 06:33:10,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:33:10,866 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-11-16 06:33:10,870 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 06:33:10,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-16 06:33:10,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:33:10,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 41 [2024-11-16 06:33:10,921 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-16 06:33:10,924 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-16 06:33:10,931 INFO L349 Elim1Store]: treesize reduction 110, result has 0.9 percent of original size [2024-11-16 06:33:10,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 248 treesize of output 205 [2024-11-16 06:33:10,947 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-16 06:33:10,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 45 [2024-11-16 06:33:10,980 INFO L349 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2024-11-16 06:33:10,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 29 [2024-11-16 06:33:11,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:33:11,251 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-16 06:33:11,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 59 [2024-11-16 06:33:11,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:33:11,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2024-11-16 06:33:11,304 INFO L349 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2024-11-16 06:33:11,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 41 [2024-11-16 06:33:11,323 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-16 06:33:11,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 58 [2024-11-16 06:33:11,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 35 [2024-11-16 06:33:11,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:33:11,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 112 [2024-11-16 06:33:11,746 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-16 06:33:11,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 179 treesize of output 127 [2024-11-16 06:33:11,821 INFO L349 Elim1Store]: treesize reduction 151, result has 9.6 percent of original size [2024-11-16 06:33:11,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 7 new quantified variables, introduced 8 case distinctions, treesize of input 226 treesize of output 228 [2024-11-16 06:33:11,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:33:11,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:33:11,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:33:11,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:33:11,943 INFO L349 Elim1Store]: treesize reduction 325, result has 14.7 percent of original size [2024-11-16 06:33:11,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 155 treesize of output 268 [2024-11-16 06:33:11,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 254 treesize of output 216 [2024-11-16 06:33:12,019 INFO L349 Elim1Store]: treesize reduction 12, result has 70.7 percent of original size [2024-11-16 06:33:12,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 41 [2024-11-16 06:33:12,056 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-16 06:33:12,081 INFO L349 Elim1Store]: treesize reduction 59, result has 16.9 percent of original size [2024-11-16 06:33:12,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 182 treesize of output 168 [2024-11-16 06:33:12,102 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2024-11-16 06:33:12,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 5 [2024-11-16 06:33:12,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2024-11-16 06:33:12,176 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-16 06:33:13,248 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 06:33:13,249 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 06:33:13,741 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 06:33:13,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 507 treesize of output 493 [2024-11-16 06:33:13,755 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 06:33:13,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 517 treesize of output 497 [2024-11-16 06:33:13,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1