./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 0209a5ecd1f90a7dc207e0462366045d25daa538d59f8499c5199765a86166a3 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 01:37:59,417 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 01:37:59,508 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 01:37:59,518 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 01:37:59,519 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 01:37:59,555 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 01:37:59,556 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 01:37:59,556 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 01:37:59,557 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 01:37:59,557 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 01:37:59,558 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 01:37:59,558 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 01:37:59,560 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 01:37:59,561 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 01:37:59,562 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 01:37:59,562 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 01:37:59,562 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 01:37:59,563 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 01:37:59,563 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 01:37:59,563 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 01:37:59,563 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 01:37:59,567 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 01:37:59,568 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 01:37:59,568 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 01:37:59,568 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 01:37:59,568 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 01:37:59,568 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 01:37:59,569 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 01:37:59,569 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 01:37:59,569 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 01:37:59,569 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 01:37:59,569 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 01:37:59,570 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 01:37:59,570 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 01:37:59,570 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 01:37:59,570 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 01:37:59,571 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 01:37:59,571 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 01:37:59,572 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 01:37:59,573 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 01:37:59,573 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 01:37:59,573 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 01:37:59,574 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-clean/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-clean/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 -> 0209a5ecd1f90a7dc207e0462366045d25daa538d59f8499c5199765a86166a3 [2024-10-11 01:37:59,836 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 01:37:59,860 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 01:37:59,864 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 01:37:59,865 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 01:37:59,865 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 01:37:59,867 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i [2024-10-11 01:38:01,352 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 01:38:01,603 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 01:38:01,605 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i [2024-10-11 01:38:01,619 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/346c37a38/d439ae02e67f4735a7a246dd848fde1c/FLAG741408b46 [2024-10-11 01:38:01,631 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/346c37a38/d439ae02e67f4735a7a246dd848fde1c [2024-10-11 01:38:01,633 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 01:38:01,635 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 01:38:01,637 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 01:38:01,637 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 01:38:01,642 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 01:38:01,643 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:38:01" (1/1) ... [2024-10-11 01:38:01,644 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5077cb97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:38:01, skipping insertion in model container [2024-10-11 01:38:01,644 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:38:01" (1/1) ... [2024-10-11 01:38:01,694 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 01:38:02,003 WARN L248 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-rb-cnstr_1-2.i[22575,22588] [2024-10-11 01:38:02,014 WARN L248 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-rb-cnstr_1-2.i[22647,22660] [2024-10-11 01:38:02,018 WARN L248 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-rb-cnstr_1-2.i[22815,22828] [2024-10-11 01:38:02,027 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 01:38:02,038 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 01:38:02,075 WARN L248 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-rb-cnstr_1-2.i[22575,22588] [2024-10-11 01:38:02,076 WARN L248 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-rb-cnstr_1-2.i[22647,22660] [2024-10-11 01:38:02,077 WARN L248 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-rb-cnstr_1-2.i[22815,22828] [2024-10-11 01:38:02,081 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 01:38:02,119 INFO L204 MainTranslator]: Completed translation [2024-10-11 01:38:02,119 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:38:02 WrapperNode [2024-10-11 01:38:02,119 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 01:38:02,121 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 01:38:02,122 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 01:38:02,122 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 01:38:02,129 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:38:02" (1/1) ... [2024-10-11 01:38:02,140 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:38:02" (1/1) ... [2024-10-11 01:38:02,167 INFO L138 Inliner]: procedures = 119, calls = 38, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 120 [2024-10-11 01:38:02,167 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 01:38:02,168 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 01:38:02,172 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 01:38:02,172 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 01:38:02,183 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:38:02" (1/1) ... [2024-10-11 01:38:02,184 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:38:02" (1/1) ... [2024-10-11 01:38:02,188 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:38:02" (1/1) ... [2024-10-11 01:38:02,221 INFO L175 MemorySlicer]: Split 28 memory accesses to 2 slices as follows [2, 26]. 93 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 12 writes are split as follows [0, 12]. [2024-10-11 01:38:02,224 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:38:02" (1/1) ... [2024-10-11 01:38:02,225 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:38:02" (1/1) ... [2024-10-11 01:38:02,237 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:38:02" (1/1) ... [2024-10-11 01:38:02,245 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:38:02" (1/1) ... [2024-10-11 01:38:02,247 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:38:02" (1/1) ... [2024-10-11 01:38:02,249 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:38:02" (1/1) ... [2024-10-11 01:38:02,252 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 01:38:02,258 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 01:38:02,259 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 01:38:02,259 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 01:38:02,260 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:38:02" (1/1) ... [2024-10-11 01:38:02,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 01:38:02,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:38:02,291 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 01:38:02,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 01:38:02,349 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 01:38:02,349 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 01:38:02,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 01:38:02,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 01:38:02,349 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 01:38:02,349 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 01:38:02,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 01:38:02,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 01:38:02,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 01:38:02,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 01:38:02,350 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 01:38:02,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 01:38:02,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 01:38:02,350 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 01:38:02,350 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 01:38:02,476 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 01:38:02,478 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 01:38:02,702 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-11 01:38:02,702 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 01:38:02,736 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 01:38:02,736 INFO L314 CfgBuilder]: Removed 9 assume(true) statements. [2024-10-11 01:38:02,737 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:38:02 BoogieIcfgContainer [2024-10-11 01:38:02,737 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 01:38:02,739 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 01:38:02,740 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 01:38:02,744 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 01:38:02,744 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:38:01" (1/3) ... [2024-10-11 01:38:02,745 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43bef696 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:38:02, skipping insertion in model container [2024-10-11 01:38:02,745 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:38:02" (2/3) ... [2024-10-11 01:38:02,745 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43bef696 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:38:02, skipping insertion in model container [2024-10-11 01:38:02,745 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:38:02" (3/3) ... [2024-10-11 01:38:02,746 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-rb-cnstr_1-2.i [2024-10-11 01:38:02,759 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 01:38:02,759 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-10-11 01:38:02,811 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 01:38:02,817 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;@3e21044c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 01:38:02,817 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-10-11 01:38:02,821 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 25 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:38:02,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 01:38:02,827 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:38:02,828 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 01:38:02,828 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:38:02,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:38:02,834 INFO L85 PathProgramCache]: Analyzing trace with hash 138222488, now seen corresponding path program 1 times [2024-10-11 01:38:02,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:38:02,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739775877] [2024-10-11 01:38:02,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:38:02,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:38:02,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:38:03,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:38:03,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:38:03,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739775877] [2024-10-11 01:38:03,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739775877] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:38:03,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:38:03,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 01:38:03,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537972851] [2024-10-11 01:38:03,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:38:03,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 01:38:03,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:38:03,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 01:38:03,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 01:38:03,100 INFO L87 Difference]: Start difference. First operand has 26 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 25 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:38:03,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:38:03,140 INFO L93 Difference]: Finished difference Result 48 states and 79 transitions. [2024-10-11 01:38:03,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 01:38:03,143 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-11 01:38:03,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:38:03,165 INFO L225 Difference]: With dead ends: 48 [2024-10-11 01:38:03,165 INFO L226 Difference]: Without dead ends: 22 [2024-10-11 01:38:03,168 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 01:38:03,173 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 01:38:03,178 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 29 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 01:38:03,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-10-11 01:38:03,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-10-11 01:38:03,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:38:03,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2024-10-11 01:38:03,205 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 5 [2024-10-11 01:38:03,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:38:03,206 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2024-10-11 01:38:03,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:38:03,206 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2024-10-11 01:38:03,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 01:38:03,207 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:38:03,207 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 01:38:03,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 01:38:03,207 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:38:03,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:38:03,208 INFO L85 PathProgramCache]: Analyzing trace with hash -22439201, now seen corresponding path program 1 times [2024-10-11 01:38:03,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:38:03,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733868641] [2024-10-11 01:38:03,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:38:03,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:38:03,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:38:03,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:38:03,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:38:03,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733868641] [2024-10-11 01:38:03,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733868641] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:38:03,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:38:03,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 01:38:03,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984804393] [2024-10-11 01:38:03,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:38:03,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 01:38:03,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:38:03,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 01:38:03,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 01:38:03,360 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:38:03,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:38:03,431 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2024-10-11 01:38:03,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 01:38:03,431 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2024-10-11 01:38:03,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:38:03,433 INFO L225 Difference]: With dead ends: 30 [2024-10-11 01:38:03,434 INFO L226 Difference]: Without dead ends: 28 [2024-10-11 01:38:03,434 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-10-11 01:38:03,435 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 40 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 01:38:03,436 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 23 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 01:38:03,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-11 01:38:03,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 20. [2024-10-11 01:38:03,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 19 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-10-11 01:38:03,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2024-10-11 01:38:03,441 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 6 [2024-10-11 01:38:03,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:38:03,442 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2024-10-11 01:38:03,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:38:03,442 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2024-10-11 01:38:03,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 01:38:03,443 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:38:03,443 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:38:03,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 01:38:03,444 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:38:03,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:38:03,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1532606602, now seen corresponding path program 1 times [2024-10-11 01:38:03,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:38:03,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238759171] [2024-10-11 01:38:03,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:38:03,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:38:03,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:38:03,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:38:03,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:38:03,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238759171] [2024-10-11 01:38:03,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238759171] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:38:03,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:38:03,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 01:38:03,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659911942] [2024-10-11 01:38:03,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:38:03,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 01:38:03,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:38:03,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 01:38:03,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 01:38:03,686 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:38:03,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:38:03,819 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2024-10-11 01:38:03,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 01:38:03,820 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2024-10-11 01:38:03,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:38:03,821 INFO L225 Difference]: With dead ends: 46 [2024-10-11 01:38:03,821 INFO L226 Difference]: Without dead ends: 44 [2024-10-11 01:38:03,822 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-10-11 01:38:03,823 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 32 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:38:03,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 64 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 01:38:03,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-11 01:38:03,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 27. [2024-10-11 01:38:03,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 25 states have (on average 1.24) internal successors, (31), 26 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:38:03,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2024-10-11 01:38:03,832 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 9 [2024-10-11 01:38:03,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:38:03,832 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2024-10-11 01:38:03,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:38:03,833 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2024-10-11 01:38:03,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-11 01:38:03,833 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:38:03,834 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:38:03,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 01:38:03,834 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:38:03,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:38:03,835 INFO L85 PathProgramCache]: Analyzing trace with hash -400036596, now seen corresponding path program 1 times [2024-10-11 01:38:03,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:38:03,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662113289] [2024-10-11 01:38:03,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:38:03,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:38:03,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:38:04,638 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:38:04,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:38:04,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662113289] [2024-10-11 01:38:04,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662113289] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:38:04,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [184071327] [2024-10-11 01:38:04,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:38:04,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:38:04,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:38:04,642 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:38:04,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 01:38:04,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:38:04,803 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-10-11 01:38:04,812 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:38:04,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 01:38:04,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 01:38:05,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:38:05,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:38:05,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:38:05,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2024-10-11 01:38:05,061 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-11 01:38:05,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-10-11 01:38:05,101 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-11 01:38:05,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-10-11 01:38:05,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 56 [2024-10-11 01:38:05,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 75 [2024-10-11 01:38:05,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:38:05,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 11 [2024-10-11 01:38:05,220 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 01:38:05,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 14 [2024-10-11 01:38:05,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 62 [2024-10-11 01:38:05,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 50 [2024-10-11 01:38:05,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 58 [2024-10-11 01:38:05,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 56 [2024-10-11 01:38:05,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 60 [2024-10-11 01:38:05,358 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:38:05,358 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:38:05,402 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:38:05,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2024-10-11 01:38:05,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 51 [2024-10-11 01:38:05,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2024-10-11 01:38:12,178 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:38:12,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [184071327] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 01:38:12,179 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 01:38:12,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-10-11 01:38:12,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761721222] [2024-10-11 01:38:12,180 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 01:38:12,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 01:38:12,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:38:12,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 01:38:12,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=116, Unknown=1, NotChecked=0, Total=156 [2024-10-11 01:38:12,183 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 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-10-11 01:38:12,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:38:12,514 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2024-10-11 01:38:12,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 01:38:12,516 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 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 12 [2024-10-11 01:38:12,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:38:12,516 INFO L225 Difference]: With dead ends: 38 [2024-10-11 01:38:12,516 INFO L226 Difference]: Without dead ends: 36 [2024-10-11 01:38:12,517 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=79, Invalid=192, Unknown=1, NotChecked=0, Total=272 [2024-10-11 01:38:12,518 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 71 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 01:38:12,518 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 86 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 01:38:12,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-10-11 01:38:12,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 18. [2024-10-11 01:38:12,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 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-10-11 01:38:12,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2024-10-11 01:38:12,526 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 12 [2024-10-11 01:38:12,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:38:12,527 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2024-10-11 01:38:12,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 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-10-11 01:38:12,527 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2024-10-11 01:38:12,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 01:38:12,529 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:38:12,529 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:38:12,548 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 01:38:12,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:38:12,731 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:38:12,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:38:12,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1631357124, now seen corresponding path program 1 times [2024-10-11 01:38:12,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:38:12,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122639402] [2024-10-11 01:38:12,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:38:12,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:38:12,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:38:12,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:38:12,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:38:12,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122639402] [2024-10-11 01:38:12,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122639402] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:38:12,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:38:12,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 01:38:12,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987027704] [2024-10-11 01:38:12,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:38:12,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 01:38:12,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:38:12,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 01:38:12,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 01:38:12,808 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:38:12,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:38:12,890 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2024-10-11 01:38:12,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 01:38:12,891 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2024-10-11 01:38:12,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:38:12,892 INFO L225 Difference]: With dead ends: 34 [2024-10-11 01:38:12,895 INFO L226 Difference]: Without dead ends: 26 [2024-10-11 01:38:12,895 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 01:38:12,896 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 9 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:38:12,896 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 41 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 01:38:12,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-10-11 01:38:12,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 20. [2024-10-11 01:38:12,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 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-10-11 01:38:12,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2024-10-11 01:38:12,902 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 14 [2024-10-11 01:38:12,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:38:12,902 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2024-10-11 01:38:12,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:38:12,902 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2024-10-11 01:38:12,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 01:38:12,903 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:38:12,903 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:38:12,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 01:38:12,903 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:38:12,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:38:12,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1631297542, now seen corresponding path program 1 times [2024-10-11 01:38:12,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:38:12,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800660175] [2024-10-11 01:38:12,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:38:12,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:38:12,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 01:38:12,918 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 01:38:12,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 01:38:12,946 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 01:38:12,947 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 01:38:12,948 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2024-10-11 01:38:12,950 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2024-10-11 01:38:12,950 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2024-10-11 01:38:12,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 01:38:12,953 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-11 01:38:12,972 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 01:38:12,976 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 01:38:12 BoogieIcfgContainer [2024-10-11 01:38:12,976 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 01:38:12,977 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 01:38:12,977 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 01:38:12,977 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 01:38:12,978 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:38:02" (3/4) ... [2024-10-11 01:38:12,978 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-11 01:38:13,030 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 01:38:13,030 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 01:38:13,031 INFO L158 Benchmark]: Toolchain (without parser) took 11396.12ms. Allocated memory was 161.5MB in the beginning and 264.2MB in the end (delta: 102.8MB). Free memory was 104.3MB in the beginning and 134.3MB in the end (delta: -30.0MB). Peak memory consumption was 75.6MB. Max. memory is 16.1GB. [2024-10-11 01:38:13,031 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 161.5MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 01:38:13,031 INFO L158 Benchmark]: CACSL2BoogieTranslator took 482.90ms. Allocated memory is still 161.5MB. Free memory was 104.3MB in the beginning and 84.5MB in the end (delta: 19.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-11 01:38:13,032 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.32ms. Allocated memory is still 161.5MB. Free memory was 84.5MB in the beginning and 82.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 01:38:13,032 INFO L158 Benchmark]: Boogie Preprocessor took 84.03ms. Allocated memory is still 161.5MB. Free memory was 82.4MB in the beginning and 79.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 01:38:13,032 INFO L158 Benchmark]: RCFGBuilder took 478.63ms. Allocated memory is still 161.5MB. Free memory was 79.2MB in the beginning and 60.3MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-11 01:38:13,033 INFO L158 Benchmark]: TraceAbstraction took 10237.51ms. Allocated memory was 161.5MB in the beginning and 264.2MB in the end (delta: 102.8MB). Free memory was 60.0MB in the beginning and 136.4MB in the end (delta: -76.4MB). Peak memory consumption was 29.5MB. Max. memory is 16.1GB. [2024-10-11 01:38:13,033 INFO L158 Benchmark]: Witness Printer took 53.55ms. Allocated memory is still 264.2MB. Free memory was 136.4MB in the beginning and 134.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 01:38:13,034 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.17ms. Allocated memory is still 161.5MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 482.90ms. Allocated memory is still 161.5MB. Free memory was 104.3MB in the beginning and 84.5MB in the end (delta: 19.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.32ms. Allocated memory is still 161.5MB. Free memory was 84.5MB in the beginning and 82.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 84.03ms. Allocated memory is still 161.5MB. Free memory was 82.4MB in the beginning and 79.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 478.63ms. Allocated memory is still 161.5MB. Free memory was 79.2MB in the beginning and 60.3MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 10237.51ms. Allocated memory was 161.5MB in the beginning and 264.2MB in the end (delta: 102.8MB). Free memory was 60.0MB in the beginning and 136.4MB in the end (delta: -76.4MB). Peak memory consumption was 29.5MB. Max. memory is 16.1GB. * Witness Printer took 53.55ms. Allocated memory is still 264.2MB. Free memory was 136.4MB in the beginning and 134.3MB 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: 1051]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1005] SLL* list = malloc(sizeof(SLL)); [L1006] list->next = ((void*)0) [L1007] list->prev = ((void*)0) [L1008] list->colour = BLACK [L1010] SLL* end = list; VAL [end={-1:0}, list={-1:0}] [L1013] COND FALSE !(__VERIFIER_nondet_int()) [L1036] end = ((void*)0) [L1037] end = list VAL [end={-1:0}, list={-1:0}] [L1040] COND FALSE !(!(((void*)0) != end)) VAL [end={-1:0}, list={-1:0}] [L1041] EXPR end->colour [L1041] COND FALSE !(!(BLACK == end->colour)) [L1043] COND TRUE ((void*)0) != end [L1045] EXPR end->colour [L1045] COND FALSE !(RED == end->colour) [L1051] EXPR end->next [L1051] COND TRUE !(end->next) [L1051] reach_error() VAL [end={-1:0}, list={-1:0}] - UnprovableResult [Line: 1040]: 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: 1041]: 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, 26 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 10.2s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 152 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 152 mSDsluCounter, 243 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 146 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 172 IncrementalHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 97 mSDtfsCounter, 172 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 5.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=3, InterpolantAutomatonStates: 25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 49 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 8.5s InterpolantComputationTime, 72 NumberOfCodeBlocks, 72 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 63 ConstructedInterpolants, 3 QuantifiedInterpolants, 2438 SizeOfPredicates, 8 NumberOfNonLiveVariables, 192 ConjunctsInSsa, 41 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 0/6 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-10-11 01:38:13,072 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE