./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/forester-heap/dll-01-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/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/dll-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 dd9f812dd0592e9d2894b2831060b27794691dcfdafe5c5494c28350656b71ee --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 00:47:41,511 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 00:47:41,567 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-22 00:47:41,572 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 00:47:41,573 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 00:47:41,596 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 00:47:41,597 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 00:47:41,597 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 00:47:41,598 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 00:47:41,599 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 00:47:41,599 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 00:47:41,599 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 00:47:41,600 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 00:47:41,602 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 00:47:41,602 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 00:47:41,602 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 00:47:41,602 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 00:47:41,603 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 00:47:41,603 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 00:47:41,603 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 00:47:41,603 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 00:47:41,604 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 00:47:41,606 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 00:47:41,607 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 00:47:41,607 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 00:47:41,607 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 00:47:41,608 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 00:47:41,608 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 00:47:41,608 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 00:47:41,608 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 00:47:41,608 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 00:47:41,609 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 00:47:41,609 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 00:47:41,609 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 00:47:41,609 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 00:47:41,609 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 00:47:41,609 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 00:47:41,609 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 00:47:41,610 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 00:47:41,610 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 00:47:41,610 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 00:47:41,610 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 00:47:41,611 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 -> dd9f812dd0592e9d2894b2831060b27794691dcfdafe5c5494c28350656b71ee [2024-11-22 00:47:41,823 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 00:47:41,842 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 00:47:41,845 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 00:47:41,846 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 00:47:41,847 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 00:47:41,848 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-01-1.i [2024-11-22 00:47:43,040 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 00:47:43,265 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 00:47:43,266 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i [2024-11-22 00:47:43,276 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/680ceee4f/b9a90f72484e458584beabfd80cf49b4/FLAGae35d64b0 [2024-11-22 00:47:43,599 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/680ceee4f/b9a90f72484e458584beabfd80cf49b4 [2024-11-22 00:47:43,602 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 00:47:43,603 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 00:47:43,605 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 00:47:43,606 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 00:47:43,609 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 00:47:43,610 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:47:43" (1/1) ... [2024-11-22 00:47:43,611 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69442ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:47:43, skipping insertion in model container [2024-11-22 00:47:43,612 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:47:43" (1/1) ... [2024-11-22 00:47:43,653 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 00:47:43,901 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/dll-01-1.i[22080,22093] [2024-11-22 00:47:43,935 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/dll-01-1.i[22353,22366] [2024-11-22 00:47:43,938 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/dll-01-1.i[22587,22600] [2024-11-22 00:47:43,938 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/dll-01-1.i[22657,22670] [2024-11-22 00:47:43,940 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/dll-01-1.i[22924,22937] [2024-11-22 00:47:43,941 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/dll-01-1.i[23032,23045] [2024-11-22 00:47:43,943 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/dll-01-1.i[23263,23276] [2024-11-22 00:47:43,944 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/dll-01-1.i[23343,23356] [2024-11-22 00:47:43,944 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/dll-01-1.i[23422,23435] [2024-11-22 00:47:43,945 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/dll-01-1.i[23512,23525] [2024-11-22 00:47:43,949 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/dll-01-1.i[23690,23703] [2024-11-22 00:47:43,949 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/dll-01-1.i[23768,23781] [2024-11-22 00:47:43,950 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/dll-01-1.i[23845,23858] [2024-11-22 00:47:43,954 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 00:47:43,967 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 00:47:44,023 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/dll-01-1.i[22080,22093] [2024-11-22 00:47:44,026 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/dll-01-1.i[22353,22366] [2024-11-22 00:47:44,027 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/dll-01-1.i[22587,22600] [2024-11-22 00:47:44,027 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/dll-01-1.i[22657,22670] [2024-11-22 00:47:44,030 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/dll-01-1.i[22924,22937] [2024-11-22 00:47:44,031 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/dll-01-1.i[23032,23045] [2024-11-22 00:47:44,034 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/dll-01-1.i[23263,23276] [2024-11-22 00:47:44,034 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/dll-01-1.i[23343,23356] [2024-11-22 00:47:44,035 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/dll-01-1.i[23422,23435] [2024-11-22 00:47:44,036 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/dll-01-1.i[23512,23525] [2024-11-22 00:47:44,037 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/dll-01-1.i[23690,23703] [2024-11-22 00:47:44,040 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/dll-01-1.i[23768,23781] [2024-11-22 00:47:44,041 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/dll-01-1.i[23845,23858] [2024-11-22 00:47:44,042 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 00:47:44,066 INFO L204 MainTranslator]: Completed translation [2024-11-22 00:47:44,067 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:47:44 WrapperNode [2024-11-22 00:47:44,067 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 00:47:44,068 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 00:47:44,068 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 00:47:44,069 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 00:47:44,073 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:47:44" (1/1) ... [2024-11-22 00:47:44,082 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:47:44" (1/1) ... [2024-11-22 00:47:44,106 INFO L138 Inliner]: procedures = 119, calls = 44, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 228 [2024-11-22 00:47:44,107 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 00:47:44,107 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 00:47:44,107 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 00:47:44,107 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 00:47:44,116 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:47:44" (1/1) ... [2024-11-22 00:47:44,116 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:47:44" (1/1) ... [2024-11-22 00:47:44,120 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:47:44" (1/1) ... [2024-11-22 00:47:44,136 INFO L175 MemorySlicer]: Split 34 memory accesses to 2 slices as follows [2, 32]. 94 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 13 writes are split as follows [0, 13]. [2024-11-22 00:47:44,140 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:47:44" (1/1) ... [2024-11-22 00:47:44,140 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:47:44" (1/1) ... [2024-11-22 00:47:44,149 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:47:44" (1/1) ... [2024-11-22 00:47:44,156 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:47:44" (1/1) ... [2024-11-22 00:47:44,157 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:47:44" (1/1) ... [2024-11-22 00:47:44,158 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:47:44" (1/1) ... [2024-11-22 00:47:44,160 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 00:47:44,161 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 00:47:44,161 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 00:47:44,161 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 00:47:44,164 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:47:44" (1/1) ... [2024-11-22 00:47:44,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 00:47:44,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 00:47:44,195 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-22 00:47:44,203 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-22 00:47:44,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-22 00:47:44,243 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 00:47:44,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-22 00:47:44,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-22 00:47:44,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-22 00:47:44,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-22 00:47:44,244 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-22 00:47:44,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 00:47:44,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-22 00:47:44,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 00:47:44,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 00:47:44,348 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 00:47:44,350 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 00:47:44,619 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-22 00:47:44,619 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 00:47:44,633 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 00:47:44,634 INFO L316 CfgBuilder]: Removed 30 assume(true) statements. [2024-11-22 00:47:44,635 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:47:44 BoogieIcfgContainer [2024-11-22 00:47:44,635 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 00:47:44,636 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 00:47:44,636 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 00:47:44,639 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 00:47:44,639 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 12:47:43" (1/3) ... [2024-11-22 00:47:44,639 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6966e97a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:47:44, skipping insertion in model container [2024-11-22 00:47:44,639 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:47:44" (2/3) ... [2024-11-22 00:47:44,640 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6966e97a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:47:44, skipping insertion in model container [2024-11-22 00:47:44,640 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:47:44" (3/3) ... [2024-11-22 00:47:44,641 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-01-1.i [2024-11-22 00:47:44,655 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 00:47:44,656 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations. [2024-11-22 00:47:44,712 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 00:47:44,721 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;@46f1d547, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 00:47:44,721 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2024-11-22 00:47:44,725 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 69 states have (on average 1.9565217391304348) internal successors, (135), 82 states have internal predecessors, (135), 0 states have call successors, (0), 0 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-22 00:47:44,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-22 00:47:44,730 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:47:44,731 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-22 00:47:44,732 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-11-22 00:47:44,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:47:44,737 INFO L85 PathProgramCache]: Analyzing trace with hash 925700, now seen corresponding path program 1 times [2024-11-22 00:47:44,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:47:44,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678728664] [2024-11-22 00:47:44,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:47:44,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:47:44,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:47:44,889 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-22 00:47:44,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:47:44,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678728664] [2024-11-22 00:47:44,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678728664] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 00:47:44,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 00:47:44,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 00:47:44,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207482477] [2024-11-22 00:47:44,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 00:47:44,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 00:47:44,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:47:44,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 00:47:44,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 00:47:44,916 INFO L87 Difference]: Start difference. First operand has 83 states, 69 states have (on average 1.9565217391304348) internal successors, (135), 82 states have internal predecessors, (135), 0 states have call successors, (0), 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.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 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-22 00:47:44,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:47:44,963 INFO L93 Difference]: Finished difference Result 180 states and 296 transitions. [2024-11-22 00:47:44,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 00:47:44,970 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2024-11-22 00:47:44,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:47:44,976 INFO L225 Difference]: With dead ends: 180 [2024-11-22 00:47:44,976 INFO L226 Difference]: Without dead ends: 95 [2024-11-22 00:47:44,978 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-22 00:47:44,981 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 83 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 101 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-22 00:47:44,981 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 101 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 00:47:44,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-22 00:47:45,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 77. [2024-11-22 00:47:45,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 65 states have (on average 1.323076923076923) internal successors, (86), 76 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:47:45,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2024-11-22 00:47:45,007 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 4 [2024-11-22 00:47:45,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:47:45,008 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2024-11-22 00:47:45,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 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-22 00:47:45,008 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2024-11-22 00:47:45,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-22 00:47:45,008 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:47:45,008 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 00:47:45,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-22 00:47:45,009 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-11-22 00:47:45,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:47:45,010 INFO L85 PathProgramCache]: Analyzing trace with hash 261454926, now seen corresponding path program 1 times [2024-11-22 00:47:45,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:47:45,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278372734] [2024-11-22 00:47:45,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:47:45,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:47:45,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:47:45,067 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-22 00:47:45,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:47:45,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278372734] [2024-11-22 00:47:45,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278372734] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 00:47:45,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 00:47:45,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 00:47:45,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361086172] [2024-11-22 00:47:45,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 00:47:45,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 00:47:45,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:47:45,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 00:47:45,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 00:47:45,070 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 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-22 00:47:45,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:47:45,087 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2024-11-22 00:47:45,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 00:47:45,088 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2024-11-22 00:47:45,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:47:45,088 INFO L225 Difference]: With dead ends: 80 [2024-11-22 00:47:45,089 INFO L226 Difference]: Without dead ends: 78 [2024-11-22 00:47:45,089 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-22 00:47:45,090 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 0 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 00:47:45,090 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 165 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 00:47:45,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-22 00:47:45,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-11-22 00:47:45,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 66 states have (on average 1.3181818181818181) internal successors, (87), 77 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:47:45,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 87 transitions. [2024-11-22 00:47:45,098 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 87 transitions. Word has length 10 [2024-11-22 00:47:45,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:47:45,100 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 87 transitions. [2024-11-22 00:47:45,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 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-22 00:47:45,100 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2024-11-22 00:47:45,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-22 00:47:45,101 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:47:45,101 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 00:47:45,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 00:47:45,102 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-11-22 00:47:45,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:47:45,104 INFO L85 PathProgramCache]: Analyzing trace with hash 261456848, now seen corresponding path program 1 times [2024-11-22 00:47:45,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:47:45,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611405874] [2024-11-22 00:47:45,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:47:45,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:47:45,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:47:45,283 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-22 00:47:45,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:47:45,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611405874] [2024-11-22 00:47:45,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611405874] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 00:47:45,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 00:47:45,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 00:47:45,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453772177] [2024-11-22 00:47:45,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 00:47:45,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 00:47:45,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:47:45,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 00:47:45,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-22 00:47:45,285 INFO L87 Difference]: Start difference. First operand 78 states and 87 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 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-22 00:47:45,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:47:45,350 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2024-11-22 00:47:45,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 00:47:45,350 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2024-11-22 00:47:45,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:47:45,351 INFO L225 Difference]: With dead ends: 79 [2024-11-22 00:47:45,351 INFO L226 Difference]: Without dead ends: 77 [2024-11-22 00:47:45,352 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-22 00:47:45,352 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 0 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 219 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-22 00:47:45,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 219 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 00:47:45,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-22 00:47:45,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2024-11-22 00:47:45,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 64 states have (on average 1.3125) internal successors, (84), 74 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:47:45,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 84 transitions. [2024-11-22 00:47:45,361 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 84 transitions. Word has length 10 [2024-11-22 00:47:45,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:47:45,361 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 84 transitions. [2024-11-22 00:47:45,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 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-22 00:47:45,362 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2024-11-22 00:47:45,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-22 00:47:45,362 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:47:45,362 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 00:47:45,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 00:47:45,363 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-11-22 00:47:45,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:47:45,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1712619113, now seen corresponding path program 1 times [2024-11-22 00:47:45,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:47:45,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023910613] [2024-11-22 00:47:45,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:47:45,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:47:45,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:47:45,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 00:47:45,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:47:45,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023910613] [2024-11-22 00:47:45,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023910613] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 00:47:45,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 00:47:45,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 00:47:45,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243203074] [2024-11-22 00:47:45,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 00:47:45,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 00:47:45,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:47:45,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 00:47:45,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 00:47:45,535 INFO L87 Difference]: Start difference. First operand 75 states and 84 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 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-22 00:47:45,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:47:45,622 INFO L93 Difference]: Finished difference Result 195 states and 217 transitions. [2024-11-22 00:47:45,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 00:47:45,623 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2024-11-22 00:47:45,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:47:45,624 INFO L225 Difference]: With dead ends: 195 [2024-11-22 00:47:45,624 INFO L226 Difference]: Without dead ends: 128 [2024-11-22 00:47:45,625 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-22 00:47:45,625 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 56 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 00:47:45,626 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 199 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 00:47:45,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-22 00:47:45,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 77. [2024-11-22 00:47:45,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 66 states have (on average 1.303030303030303) internal successors, (86), 76 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:47:45,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2024-11-22 00:47:45,632 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 15 [2024-11-22 00:47:45,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:47:45,632 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2024-11-22 00:47:45,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 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-22 00:47:45,633 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2024-11-22 00:47:45,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-22 00:47:45,633 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:47:45,633 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 00:47:45,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 00:47:45,634 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-11-22 00:47:45,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:47:45,634 INFO L85 PathProgramCache]: Analyzing trace with hash 903272487, now seen corresponding path program 1 times [2024-11-22 00:47:45,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:47:45,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457318816] [2024-11-22 00:47:45,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:47:45,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:47:45,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:47:45,797 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-22 00:47:45,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:47:45,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457318816] [2024-11-22 00:47:45,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457318816] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 00:47:45,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 00:47:45,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 00:47:45,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755314751] [2024-11-22 00:47:45,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 00:47:45,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 00:47:45,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:47:45,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 00:47:45,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 00:47:45,802 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 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-22 00:47:45,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:47:45,918 INFO L93 Difference]: Finished difference Result 121 states and 135 transitions. [2024-11-22 00:47:45,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 00:47:45,918 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2024-11-22 00:47:45,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:47:45,919 INFO L225 Difference]: With dead ends: 121 [2024-11-22 00:47:45,919 INFO L226 Difference]: Without dead ends: 117 [2024-11-22 00:47:45,920 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-22 00:47:45,921 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 149 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 00:47:45,921 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 157 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 00:47:45,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-22 00:47:45,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 73. [2024-11-22 00:47:45,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 64 states have (on average 1.28125) internal successors, (82), 72 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:47:45,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 82 transitions. [2024-11-22 00:47:45,928 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 82 transitions. Word has length 15 [2024-11-22 00:47:45,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:47:45,928 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 82 transitions. [2024-11-22 00:47:45,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 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-22 00:47:45,929 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 82 transitions. [2024-11-22 00:47:45,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-22 00:47:45,929 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:47:45,929 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 00:47:45,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 00:47:45,930 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-11-22 00:47:45,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:47:45,930 INFO L85 PathProgramCache]: Analyzing trace with hash -2063319775, now seen corresponding path program 1 times [2024-11-22 00:47:45,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:47:45,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057783105] [2024-11-22 00:47:45,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:47:45,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:47:45,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:47:45,969 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-22 00:47:45,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:47:45,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057783105] [2024-11-22 00:47:45,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057783105] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 00:47:45,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 00:47:45,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 00:47:45,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345145200] [2024-11-22 00:47:45,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 00:47:45,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 00:47:45,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:47:45,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 00:47:45,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 00:47:45,972 INFO L87 Difference]: Start difference. First operand 73 states and 82 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 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-22 00:47:46,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:47:46,035 INFO L93 Difference]: Finished difference Result 132 states and 146 transitions. [2024-11-22 00:47:46,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 00:47:46,035 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2024-11-22 00:47:46,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:47:46,038 INFO L225 Difference]: With dead ends: 132 [2024-11-22 00:47:46,038 INFO L226 Difference]: Without dead ends: 112 [2024-11-22 00:47:46,038 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-22 00:47:46,040 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 131 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 116 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.0s IncrementalHoareTripleChecker+Time [2024-11-22 00:47:46,041 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 116 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 00:47:46,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-22 00:47:46,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 72. [2024-11-22 00:47:46,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 64 states have (on average 1.265625) internal successors, (81), 71 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:47:46,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2024-11-22 00:47:46,052 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 16 [2024-11-22 00:47:46,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:47:46,052 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2024-11-22 00:47:46,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 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-22 00:47:46,052 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2024-11-22 00:47:46,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-22 00:47:46,053 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:47:46,053 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] [2024-11-22 00:47:46,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-22 00:47:46,053 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-11-22 00:47:46,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:47:46,054 INFO L85 PathProgramCache]: Analyzing trace with hash -940628212, now seen corresponding path program 1 times [2024-11-22 00:47:46,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:47:46,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38700920] [2024-11-22 00:47:46,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:47:46,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:47:46,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:47:46,102 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-22 00:47:46,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:47:46,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38700920] [2024-11-22 00:47:46,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38700920] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 00:47:46,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 00:47:46,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 00:47:46,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284238357] [2024-11-22 00:47:46,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 00:47:46,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 00:47:46,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:47:46,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 00:47:46,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 00:47:46,105 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 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-22 00:47:46,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:47:46,122 INFO L93 Difference]: Finished difference Result 118 states and 134 transitions. [2024-11-22 00:47:46,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 00:47:46,123 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2024-11-22 00:47:46,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:47:46,124 INFO L225 Difference]: With dead ends: 118 [2024-11-22 00:47:46,124 INFO L226 Difference]: Without dead ends: 77 [2024-11-22 00:47:46,125 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-22 00:47:46,125 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 3 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 147 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-22 00:47:46,125 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 147 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 00:47:46,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-22 00:47:46,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2024-11-22 00:47:46,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 67 states have (on average 1.2686567164179106) internal successors, (85), 74 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:47:46,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2024-11-22 00:47:46,139 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 20 [2024-11-22 00:47:46,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:47:46,139 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2024-11-22 00:47:46,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 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-22 00:47:46,139 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2024-11-22 00:47:46,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-22 00:47:46,140 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:47:46,140 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] [2024-11-22 00:47:46,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-22 00:47:46,140 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-11-22 00:47:46,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:47:46,141 INFO L85 PathProgramCache]: Analyzing trace with hash 905291998, now seen corresponding path program 1 times [2024-11-22 00:47:46,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:47:46,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641521037] [2024-11-22 00:47:46,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:47:46,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:47:46,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:47:46,182 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-22 00:47:46,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:47:46,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641521037] [2024-11-22 00:47:46,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641521037] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 00:47:46,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 00:47:46,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 00:47:46,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148513224] [2024-11-22 00:47:46,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 00:47:46,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 00:47:46,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:47:46,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 00:47:46,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 00:47:46,185 INFO L87 Difference]: Start difference. First operand 75 states and 85 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 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-22 00:47:46,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:47:46,204 INFO L93 Difference]: Finished difference Result 75 states and 85 transitions. [2024-11-22 00:47:46,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 00:47:46,205 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2024-11-22 00:47:46,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:47:46,205 INFO L225 Difference]: With dead ends: 75 [2024-11-22 00:47:46,206 INFO L226 Difference]: Without dead ends: 73 [2024-11-22 00:47:46,206 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-22 00:47:46,206 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 13 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 128 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-22 00:47:46,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 128 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 00:47:46,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-22 00:47:46,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-11-22 00:47:46,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 66 states have (on average 1.2575757575757576) internal successors, (83), 72 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:47:46,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 83 transitions. [2024-11-22 00:47:46,220 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 83 transitions. Word has length 21 [2024-11-22 00:47:46,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:47:46,220 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 83 transitions. [2024-11-22 00:47:46,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 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-22 00:47:46,220 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2024-11-22 00:47:46,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-22 00:47:46,221 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:47:46,221 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] [2024-11-22 00:47:46,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-22 00:47:46,221 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-11-22 00:47:46,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:47:46,221 INFO L85 PathProgramCache]: Analyzing trace with hash 886650935, now seen corresponding path program 1 times [2024-11-22 00:47:46,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:47:46,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191923918] [2024-11-22 00:47:46,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:47:46,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:47:46,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:47:46,307 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-22 00:47:46,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:47:46,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191923918] [2024-11-22 00:47:46,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191923918] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 00:47:46,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 00:47:46,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 00:47:46,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576632172] [2024-11-22 00:47:46,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 00:47:46,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 00:47:46,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:47:46,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 00:47:46,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-22 00:47:46,309 INFO L87 Difference]: Start difference. First operand 73 states and 83 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 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-22 00:47:46,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:47:46,359 INFO L93 Difference]: Finished difference Result 74 states and 84 transitions. [2024-11-22 00:47:46,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 00:47:46,360 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2024-11-22 00:47:46,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:47:46,360 INFO L225 Difference]: With dead ends: 74 [2024-11-22 00:47:46,360 INFO L226 Difference]: Without dead ends: 72 [2024-11-22 00:47:46,361 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-22 00:47:46,361 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 1 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 00:47:46,361 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 113 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 00:47:46,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-22 00:47:46,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2024-11-22 00:47:46,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 65 states have (on average 1.2461538461538462) internal successors, (81), 70 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:47:46,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 81 transitions. [2024-11-22 00:47:46,366 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 81 transitions. Word has length 23 [2024-11-22 00:47:46,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:47:46,367 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 81 transitions. [2024-11-22 00:47:46,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 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-22 00:47:46,367 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 81 transitions. [2024-11-22 00:47:46,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-22 00:47:46,367 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:47:46,367 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] [2024-11-22 00:47:46,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-22 00:47:46,368 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-11-22 00:47:46,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:47:46,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1458355201, now seen corresponding path program 1 times [2024-11-22 00:47:46,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:47:46,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766684996] [2024-11-22 00:47:46,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:47:46,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:47:46,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:47:46,474 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-22 00:47:46,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:47:46,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766684996] [2024-11-22 00:47:46,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766684996] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 00:47:46,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 00:47:46,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 00:47:46,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576985777] [2024-11-22 00:47:46,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 00:47:46,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 00:47:46,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:47:46,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 00:47:46,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-22 00:47:46,477 INFO L87 Difference]: Start difference. First operand 71 states and 81 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 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-22 00:47:46,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:47:46,617 INFO L93 Difference]: Finished difference Result 175 states and 199 transitions. [2024-11-22 00:47:46,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 00:47:46,618 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2024-11-22 00:47:46,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:47:46,618 INFO L225 Difference]: With dead ends: 175 [2024-11-22 00:47:46,618 INFO L226 Difference]: Without dead ends: 133 [2024-11-22 00:47:46,619 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-22 00:47:46,619 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 65 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 00:47:46,619 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 303 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 00:47:46,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-22 00:47:46,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 81. [2024-11-22 00:47:46,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 75 states have (on average 1.2266666666666666) internal successors, (92), 80 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-22 00:47:46,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 92 transitions. [2024-11-22 00:47:46,629 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 92 transitions. Word has length 24 [2024-11-22 00:47:46,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:47:46,629 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 92 transitions. [2024-11-22 00:47:46,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 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-22 00:47:46,629 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 92 transitions. [2024-11-22 00:47:46,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-22 00:47:46,631 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:47:46,631 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] [2024-11-22 00:47:46,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-22 00:47:46,632 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-11-22 00:47:46,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:47:46,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1357759361, now seen corresponding path program 1 times [2024-11-22 00:47:46,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:47:46,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259050566] [2024-11-22 00:47:46,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:47:46,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:47:46,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:47:47,111 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-22 00:47:47,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:47:47,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259050566] [2024-11-22 00:47:47,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259050566] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 00:47:47,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 00:47:47,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-22 00:47:47,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625840819] [2024-11-22 00:47:47,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 00:47:47,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 00:47:47,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:47:47,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 00:47:47,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-22 00:47:47,114 INFO L87 Difference]: Start difference. First operand 81 states and 92 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 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-22 00:47:47,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:47:47,413 INFO L93 Difference]: Finished difference Result 194 states and 216 transitions. [2024-11-22 00:47:47,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 00:47:47,414 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2024-11-22 00:47:47,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:47:47,416 INFO L225 Difference]: With dead ends: 194 [2024-11-22 00:47:47,416 INFO L226 Difference]: Without dead ends: 192 [2024-11-22 00:47:47,416 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-11-22 00:47:47,417 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 193 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 389 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-22 00:47:47,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 389 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 00:47:47,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-11-22 00:47:47,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 93. [2024-11-22 00:47:47,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 87 states have (on average 1.2183908045977012) internal successors, (106), 92 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:47:47,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 106 transitions. [2024-11-22 00:47:47,430 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 106 transitions. Word has length 24 [2024-11-22 00:47:47,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:47:47,431 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 106 transitions. [2024-11-22 00:47:47,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 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-22 00:47:47,431 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 106 transitions. [2024-11-22 00:47:47,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-22 00:47:47,431 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:47:47,432 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-22 00:47:47,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-22 00:47:47,432 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-11-22 00:47:47,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:47:47,432 INFO L85 PathProgramCache]: Analyzing trace with hash 680714775, now seen corresponding path program 1 times [2024-11-22 00:47:47,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:47:47,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275860189] [2024-11-22 00:47:47,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:47:47,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:47:47,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:47:47,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 00:47:47,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:47:47,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275860189] [2024-11-22 00:47:47,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275860189] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 00:47:47,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 00:47:47,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 00:47:47,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124848033] [2024-11-22 00:47:47,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 00:47:47,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 00:47:47,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:47:47,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 00:47:47,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-22 00:47:47,508 INFO L87 Difference]: Start difference. First operand 93 states and 106 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 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-22 00:47:47,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:47:47,607 INFO L93 Difference]: Finished difference Result 138 states and 157 transitions. [2024-11-22 00:47:47,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 00:47:47,608 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 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-22 00:47:47,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:47:47,608 INFO L225 Difference]: With dead ends: 138 [2024-11-22 00:47:47,609 INFO L226 Difference]: Without dead ends: 120 [2024-11-22 00:47:47,609 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-22 00:47:47,609 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 23 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 00:47:47,609 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 236 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 00:47:47,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-22 00:47:47,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 113. [2024-11-22 00:47:47,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 107 states have (on average 1.2429906542056075) internal successors, (133), 112 states have internal predecessors, (133), 0 states have call successors, (0), 0 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-22 00:47:47,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 133 transitions. [2024-11-22 00:47:47,621 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 133 transitions. Word has length 26 [2024-11-22 00:47:47,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:47:47,622 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 133 transitions. [2024-11-22 00:47:47,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 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-22 00:47:47,622 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 133 transitions. [2024-11-22 00:47:47,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-22 00:47:47,622 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:47:47,622 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-22 00:47:47,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-22 00:47:47,623 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-11-22 00:47:47,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:47:47,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1502606953, now seen corresponding path program 1 times [2024-11-22 00:47:47,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:47:47,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149754369] [2024-11-22 00:47:47,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:47:47,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:47:47,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:47:47,655 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 00:47:47,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:47:47,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149754369] [2024-11-22 00:47:47,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149754369] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 00:47:47,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 00:47:47,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 00:47:47,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816638955] [2024-11-22 00:47:47,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 00:47:47,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 00:47:47,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:47:47,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 00:47:47,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 00:47:47,658 INFO L87 Difference]: Start difference. First operand 113 states and 133 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-22 00:47:47,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:47:47,702 INFO L93 Difference]: Finished difference Result 113 states and 133 transitions. [2024-11-22 00:47:47,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 00:47:47,702 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-22 00:47:47,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:47:47,703 INFO L225 Difference]: With dead ends: 113 [2024-11-22 00:47:47,703 INFO L226 Difference]: Without dead ends: 111 [2024-11-22 00:47:47,703 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-22 00:47:47,703 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 49 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 77 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-22 00:47:47,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 77 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 00:47:47,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-22 00:47:47,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-11-22 00:47:47,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 106 states have (on average 1.2358490566037736) internal successors, (131), 110 states have internal predecessors, (131), 0 states have call successors, (0), 0 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-22 00:47:47,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 131 transitions. [2024-11-22 00:47:47,722 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 131 transitions. Word has length 26 [2024-11-22 00:47:47,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:47:47,722 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 131 transitions. [2024-11-22 00:47:47,722 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-22 00:47:47,722 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 131 transitions. [2024-11-22 00:47:47,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-22 00:47:47,724 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:47:47,724 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] [2024-11-22 00:47:47,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-22 00:47:47,725 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-11-22 00:47:47,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:47:47,725 INFO L85 PathProgramCache]: Analyzing trace with hash -988757936, now seen corresponding path program 1 times [2024-11-22 00:47:47,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:47:47,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429795010] [2024-11-22 00:47:47,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:47:47,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:47:47,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 00:47:47,744 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 00:47:47,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 00:47:47,774 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-22 00:47:47,774 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 00:47:47,775 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (12 of 13 remaining) [2024-11-22 00:47:47,776 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (11 of 13 remaining) [2024-11-22 00:47:47,776 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (10 of 13 remaining) [2024-11-22 00:47:47,777 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (9 of 13 remaining) [2024-11-22 00:47:47,777 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (8 of 13 remaining) [2024-11-22 00:47:47,777 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (7 of 13 remaining) [2024-11-22 00:47:47,777 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (6 of 13 remaining) [2024-11-22 00:47:47,777 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (5 of 13 remaining) [2024-11-22 00:47:47,777 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (4 of 13 remaining) [2024-11-22 00:47:47,777 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (3 of 13 remaining) [2024-11-22 00:47:47,777 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (2 of 13 remaining) [2024-11-22 00:47:47,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (1 of 13 remaining) [2024-11-22 00:47:47,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (0 of 13 remaining) [2024-11-22 00:47:47,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-22 00:47:47,780 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 00:47:47,799 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 00:47:47,801 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 12:47:47 BoogieIcfgContainer [2024-11-22 00:47:47,801 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 00:47:47,802 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 00:47:47,802 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 00:47:47,802 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 00:47:47,802 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:47:44" (3/4) ... [2024-11-22 00:47:47,803 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-22 00:47:47,837 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-22 00:47:47,837 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 00:47:47,838 INFO L158 Benchmark]: Toolchain (without parser) took 4234.97ms. Allocated memory was 169.9MB in the beginning and 232.8MB in the end (delta: 62.9MB). Free memory was 98.8MB in the beginning and 83.4MB in the end (delta: 15.4MB). Peak memory consumption was 80.5MB. Max. memory is 16.1GB. [2024-11-22 00:47:47,839 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 169.9MB. Free memory was 124.9MB in the beginning and 124.8MB in the end (delta: 155.9kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 00:47:47,839 INFO L158 Benchmark]: CACSL2BoogieTranslator took 461.73ms. Allocated memory is still 169.9MB. Free memory was 98.6MB in the beginning and 130.8MB in the end (delta: -32.2MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. [2024-11-22 00:47:47,839 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.04ms. Allocated memory is still 169.9MB. Free memory was 130.8MB in the beginning and 128.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 00:47:47,839 INFO L158 Benchmark]: Boogie Preprocessor took 53.15ms. Allocated memory is still 169.9MB. Free memory was 128.8MB in the beginning and 125.2MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-22 00:47:47,840 INFO L158 Benchmark]: RCFGBuilder took 473.91ms. Allocated memory is still 169.9MB. Free memory was 125.2MB in the beginning and 102.2MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-22 00:47:47,840 INFO L158 Benchmark]: TraceAbstraction took 3165.33ms. Allocated memory was 169.9MB in the beginning and 232.8MB in the end (delta: 62.9MB). Free memory was 101.5MB in the beginning and 85.4MB in the end (delta: 16.1MB). Peak memory consumption was 81.9MB. Max. memory is 16.1GB. [2024-11-22 00:47:47,840 INFO L158 Benchmark]: Witness Printer took 35.33ms. Allocated memory is still 232.8MB. Free memory was 85.4MB in the beginning and 83.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 00:47:47,842 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 169.9MB. Free memory was 124.9MB in the beginning and 124.8MB in the end (delta: 155.9kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 461.73ms. Allocated memory is still 169.9MB. Free memory was 98.6MB in the beginning and 130.8MB in the end (delta: -32.2MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.04ms. Allocated memory is still 169.9MB. Free memory was 130.8MB in the beginning and 128.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.15ms. Allocated memory is still 169.9MB. Free memory was 128.8MB in the beginning and 125.2MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 473.91ms. Allocated memory is still 169.9MB. Free memory was 125.2MB in the beginning and 102.2MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 3165.33ms. Allocated memory was 169.9MB in the beginning and 232.8MB in the end (delta: 62.9MB). Free memory was 101.5MB in the beginning and 85.4MB in the end (delta: 16.1MB). Peak memory consumption was 81.9MB. Max. memory is 16.1GB. * Witness Printer took 35.33ms. Allocated memory is still 232.8MB. Free memory was 85.4MB in the beginning and 83.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 1040]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1003] SLL* list = malloc(sizeof(SLL)); [L1004] list->next = ((void*)0) [L1005] list->prev = ((void*)0) [L1006] COND FALSE !(!(list != ((void*)0))) VAL [list={-1:0}] [L1006] COND FALSE !(__VERIFIER_nondet_int()) [L1006] list->inner = malloc(sizeof(SLL)) [L1006] EXPR list->inner [L1006] list->inner->next = ((void*)0) [L1006] EXPR list->inner [L1006] list->inner->inner = ((void*)0) [L1006] EXPR list->inner [L1006] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) VAL [list={-1:0}] [L1006] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) [L1006] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) [L1008] SLL* end = list; VAL [end={-1:0}, list={-1:0}] [L1011] COND FALSE !(__VERIFIER_nondet_int()) [L1022] end = ((void*)0) [L1023] end = list VAL [end={-1:0}, list={-1:0}] [L1026] COND FALSE !(!(((void*)0) != end)) VAL [end={-1:0}, list={-1:0}] [L1028] COND TRUE ((void*)0) != end [L1030] int len = 0; [L1031] EXPR end->inner [L1031] SLL* inner = end->inner; [L1032] COND TRUE ((void*)0) != inner VAL [end={-1:0}, inner={-2:0}, len=0, list={-1:0}] [L1034] COND TRUE len == 0 [L1035] len = 1 VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}] [L1038] COND FALSE !(!(((void*)0) != inner)) VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}] [L1039] EXPR inner->inner [L1039] COND FALSE !(!(((void*)0) == inner->inner)) [L1040] EXPR inner->next [L1040] COND TRUE !(((void*)0) != inner->next) [L1040] reach_error() VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}] - UnprovableResult [Line: 1006]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1018]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1026]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1038]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1039]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1043]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1055]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1056]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1057]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 83 locations, 13 error locations. Started 1 CEGAR loops. OverallTime: 3.1s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 766 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 766 mSDsluCounter, 2350 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1403 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 686 IncrementalHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 947 mSDtfsCounter, 686 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=113occurred in iteration=12, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 316 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 261 NumberOfCodeBlocks, 261 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 221 ConstructedInterpolants, 0 QuantifiedInterpolants, 1365 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 2/2 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-22 00:47:47,861 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE