./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_nondet_insert-1.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/list-ext3-properties/sll_nondet_insert-1.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 724878768076b8192fcddec982755d081255c76c80e1e283d808e6a7ebb222b9 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 01:45:38,134 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 01:45:38,211 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:45:38,216 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 01:45:38,217 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 01:45:38,246 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 01:45:38,248 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 01:45:38,248 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 01:45:38,249 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 01:45:38,249 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 01:45:38,249 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 01:45:38,250 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 01:45:38,250 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 01:45:38,252 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 01:45:38,253 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 01:45:38,253 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 01:45:38,253 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 01:45:38,254 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 01:45:38,254 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 01:45:38,254 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 01:45:38,254 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 01:45:38,259 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 01:45:38,259 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 01:45:38,259 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 01:45:38,259 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 01:45:38,259 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 01:45:38,260 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 01:45:38,260 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 01:45:38,260 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 01:45:38,260 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 01:45:38,260 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 01:45:38,261 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 01:45:38,261 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 01:45:38,261 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 01:45:38,261 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 01:45:38,261 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 01:45:38,262 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 01:45:38,262 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 01:45:38,262 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 01:45:38,264 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 01:45:38,264 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 01:45:38,265 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 01:45:38,265 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 -> 724878768076b8192fcddec982755d081255c76c80e1e283d808e6a7ebb222b9 [2024-10-11 01:45:38,538 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 01:45:38,566 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 01:45:38,569 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 01:45:38,570 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 01:45:38,570 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 01:45:38,571 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_nondet_insert-1.i [2024-10-11 01:45:39,953 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 01:45:40,150 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 01:45:40,150 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_nondet_insert-1.i [2024-10-11 01:45:40,162 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7282ae2dd/201470df8fc0485ca3d1647ab7025194/FLAGbde659f10 [2024-10-11 01:45:40,526 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7282ae2dd/201470df8fc0485ca3d1647ab7025194 [2024-10-11 01:45:40,529 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 01:45:40,531 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 01:45:40,532 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 01:45:40,535 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 01:45:40,539 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 01:45:40,540 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:45:40" (1/1) ... [2024-10-11 01:45:40,542 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bd4dfb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:45:40, skipping insertion in model container [2024-10-11 01:45:40,543 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:45:40" (1/1) ... [2024-10-11 01:45:40,579 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 01:45:40,894 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/list-ext3-properties/sll_nondet_insert-1.i[24521,24534] [2024-10-11 01:45:40,898 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 01:45:40,915 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 01:45:41,004 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/list-ext3-properties/sll_nondet_insert-1.i[24521,24534] [2024-10-11 01:45:41,005 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 01:45:41,050 INFO L204 MainTranslator]: Completed translation [2024-10-11 01:45:41,050 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:45:41 WrapperNode [2024-10-11 01:45:41,050 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 01:45:41,051 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 01:45:41,051 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 01:45:41,052 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 01:45:41,059 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:45:41" (1/1) ... [2024-10-11 01:45:41,070 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:45:41" (1/1) ... [2024-10-11 01:45:41,092 INFO L138 Inliner]: procedures = 129, calls = 33, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 140 [2024-10-11 01:45:41,092 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 01:45:41,093 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 01:45:41,093 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 01:45:41,093 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 01:45:41,102 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:45:41" (1/1) ... [2024-10-11 01:45:41,103 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:45:41" (1/1) ... [2024-10-11 01:45:41,106 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:45:41" (1/1) ... [2024-10-11 01:45:41,123 INFO L175 MemorySlicer]: Split 13 memory accesses to 3 slices as follows [2, 5, 6]. 46 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 4 writes are split as follows [0, 1, 3]. [2024-10-11 01:45:41,124 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:45:41" (1/1) ... [2024-10-11 01:45:41,124 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:45:41" (1/1) ... [2024-10-11 01:45:41,130 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:45:41" (1/1) ... [2024-10-11 01:45:41,133 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:45:41" (1/1) ... [2024-10-11 01:45:41,134 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:45:41" (1/1) ... [2024-10-11 01:45:41,135 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:45:41" (1/1) ... [2024-10-11 01:45:41,138 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 01:45:41,138 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 01:45:41,139 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 01:45:41,139 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 01:45:41,139 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:45:41" (1/1) ... [2024-10-11 01:45:41,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 01:45:41,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:45:41,180 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:45:41,188 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:45:41,227 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-10-11 01:45:41,228 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-10-11 01:45:41,228 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 01:45:41,229 INFO L130 BoogieDeclarations]: Found specification of procedure _get_nondet_int [2024-10-11 01:45:41,229 INFO L138 BoogieDeclarations]: Found implementation of procedure _get_nondet_int [2024-10-11 01:45:41,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 01:45:41,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 01:45:41,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 01:45:41,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 01:45:41,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 01:45:41,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 01:45:41,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 01:45:41,230 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 01:45:41,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 01:45:41,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-11 01:45:41,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-11 01:45:41,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-11 01:45:41,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 01:45:41,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 01:45:41,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 01:45:41,232 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 01:45:41,232 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 01:45:41,360 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 01:45:41,364 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 01:45:41,390 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-10-11 01:45:41,537 INFO L? ?]: Removed 47 outVars from TransFormulas that were not future-live. [2024-10-11 01:45:41,537 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 01:45:41,565 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 01:45:41,569 INFO L314 CfgBuilder]: Removed 6 assume(true) statements. [2024-10-11 01:45:41,569 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:45:41 BoogieIcfgContainer [2024-10-11 01:45:41,569 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 01:45:41,572 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 01:45:41,572 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 01:45:41,575 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 01:45:41,575 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:45:40" (1/3) ... [2024-10-11 01:45:41,576 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ec1f91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:45:41, skipping insertion in model container [2024-10-11 01:45:41,576 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:45:41" (2/3) ... [2024-10-11 01:45:41,576 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ec1f91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:45:41, skipping insertion in model container [2024-10-11 01:45:41,576 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:45:41" (3/3) ... [2024-10-11 01:45:41,577 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_nondet_insert-1.i [2024-10-11 01:45:41,594 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 01:45:41,595 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 01:45:41,648 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 01:45:41,653 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;@6b86ff4b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 01:45:41,654 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 01:45:41,658 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 34 states have (on average 1.5588235294117647) internal successors, (53), 36 states have internal predecessors, (53), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 01:45:41,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-11 01:45:41,664 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:45:41,667 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:45:41,668 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:45:41,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:45:41,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1925725124, now seen corresponding path program 1 times [2024-10-11 01:45:41,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:45:41,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534026006] [2024-10-11 01:45:41,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:45:41,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:45:41,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:45:41,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 01:45:41,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:45:41,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 01:45:41,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:45:41,868 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 01:45:41,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:45:41,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534026006] [2024-10-11 01:45:41,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534026006] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:45:41,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:45:41,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 01:45:41,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851165197] [2024-10-11 01:45:41,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:45:41,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 01:45:41,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:45:41,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 01:45:41,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 01:45:41,908 INFO L87 Difference]: Start difference. First operand has 42 states, 34 states have (on average 1.5588235294117647) internal successors, (53), 36 states have internal predecessors, (53), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 01:45:41,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:45:41,970 INFO L93 Difference]: Finished difference Result 82 states and 122 transitions. [2024-10-11 01:45:41,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 01:45:41,978 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2024-10-11 01:45:41,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:45:42,015 INFO L225 Difference]: With dead ends: 82 [2024-10-11 01:45:42,017 INFO L226 Difference]: Without dead ends: 34 [2024-10-11 01:45:42,024 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 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:45:42,031 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 01:45:42,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 01:45:42,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-10-11 01:45:42,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-10-11 01:45:42,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 01:45:42,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2024-10-11 01:45:42,105 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 21 [2024-10-11 01:45:42,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:45:42,106 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2024-10-11 01:45:42,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 01:45:42,106 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2024-10-11 01:45:42,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-11 01:45:42,110 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:45:42,110 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:45:42,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 01:45:42,111 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:45:42,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:45:42,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1034308714, now seen corresponding path program 1 times [2024-10-11 01:45:42,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:45:42,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703189259] [2024-10-11 01:45:42,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:45:42,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:45:42,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:45:42,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 01:45:42,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:45:42,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 01:45:42,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:45:42,392 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 01:45:42,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:45:42,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703189259] [2024-10-11 01:45:42,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703189259] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:45:42,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1781800697] [2024-10-11 01:45:42,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:45:42,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:45:42,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:45:42,400 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:45:42,401 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:45:42,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:45:42,484 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 01:45:42,489 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:45:42,588 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:45:42,590 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 01:45:42,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1781800697] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:45:42,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 01:45:42,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2024-10-11 01:45:42,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917734405] [2024-10-11 01:45:42,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:45:42,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 01:45:42,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:45:42,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 01:45:42,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-11 01:45:42,595 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 01:45:42,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:45:42,649 INFO L93 Difference]: Finished difference Result 63 states and 80 transitions. [2024-10-11 01:45:42,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 01:45:42,650 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2024-10-11 01:45:42,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:45:42,651 INFO L225 Difference]: With dead ends: 63 [2024-10-11 01:45:42,651 INFO L226 Difference]: Without dead ends: 36 [2024-10-11 01:45:42,651 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-11 01:45:42,652 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 1 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 01:45:42,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 174 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 01:45:42,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-10-11 01:45:42,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-10-11 01:45:42,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 01:45:42,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2024-10-11 01:45:42,658 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 28 [2024-10-11 01:45:42,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:45:42,659 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2024-10-11 01:45:42,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 01:45:42,660 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2024-10-11 01:45:42,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-11 01:45:42,660 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:45:42,660 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:45:42,675 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:45:42,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:45:42,865 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:45:42,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:45:42,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1452360817, now seen corresponding path program 1 times [2024-10-11 01:45:42,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:45:42,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452400321] [2024-10-11 01:45:42,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:45:42,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:45:42,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:45:42,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 01:45:42,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:45:42,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 01:45:43,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:45:43,042 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 01:45:43,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:45:43,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452400321] [2024-10-11 01:45:43,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452400321] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:45:43,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:45:43,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 01:45:43,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209303772] [2024-10-11 01:45:43,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:45:43,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 01:45:43,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:45:43,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 01:45:43,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 01:45:43,044 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 01:45:43,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:45:43,148 INFO L93 Difference]: Finished difference Result 83 states and 110 transitions. [2024-10-11 01:45:43,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 01:45:43,148 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2024-10-11 01:45:43,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:45:43,150 INFO L225 Difference]: With dead ends: 83 [2024-10-11 01:45:43,150 INFO L226 Difference]: Without dead ends: 59 [2024-10-11 01:45:43,151 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-11 01:45:43,152 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 21 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:45:43,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 162 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 01:45:43,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-10-11 01:45:43,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 45. [2024-10-11 01:45:43,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 39 states have internal predecessors, (49), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-11 01:45:43,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 58 transitions. [2024-10-11 01:45:43,158 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 58 transitions. Word has length 32 [2024-10-11 01:45:43,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:45:43,159 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 58 transitions. [2024-10-11 01:45:43,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 01:45:43,159 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 58 transitions. [2024-10-11 01:45:43,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-11 01:45:43,160 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:45:43,160 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:45:43,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 01:45:43,160 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:45:43,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:45:43,161 INFO L85 PathProgramCache]: Analyzing trace with hash 322646545, now seen corresponding path program 1 times [2024-10-11 01:45:43,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:45:43,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639870816] [2024-10-11 01:45:43,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:45:43,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:45:43,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:45:43,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 01:45:43,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:45:43,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 01:45:43,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:45:43,282 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 01:45:43,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:45:43,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639870816] [2024-10-11 01:45:43,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639870816] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:45:43,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:45:43,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 01:45:43,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411875306] [2024-10-11 01:45:43,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:45:43,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 01:45:43,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:45:43,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 01:45:43,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 01:45:43,287 INFO L87 Difference]: Start difference. First operand 45 states and 58 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 01:45:43,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:45:43,357 INFO L93 Difference]: Finished difference Result 71 states and 90 transitions. [2024-10-11 01:45:43,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 01:45:43,357 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 32 [2024-10-11 01:45:43,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:45:43,358 INFO L225 Difference]: With dead ends: 71 [2024-10-11 01:45:43,359 INFO L226 Difference]: Without dead ends: 67 [2024-10-11 01:45:43,359 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 01:45:43,360 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 20 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 01:45:43,360 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 158 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 01:45:43,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-11 01:45:43,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 60. [2024-10-11 01:45:43,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 53 states have internal predecessors, (67), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-10-11 01:45:43,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 79 transitions. [2024-10-11 01:45:43,367 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 79 transitions. Word has length 32 [2024-10-11 01:45:43,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:45:43,367 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 79 transitions. [2024-10-11 01:45:43,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 01:45:43,367 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 79 transitions. [2024-10-11 01:45:43,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-11 01:45:43,368 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:45:43,368 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:45:43,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 01:45:43,369 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:45:43,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:45:43,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1412675870, now seen corresponding path program 1 times [2024-10-11 01:45:43,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:45:43,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935572748] [2024-10-11 01:45:43,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:45:43,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:45:43,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:45:43,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 01:45:43,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:45:43,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 01:45:43,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:45:43,507 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 01:45:43,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:45:43,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935572748] [2024-10-11 01:45:43,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935572748] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:45:43,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [341627283] [2024-10-11 01:45:43,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:45:43,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:45:43,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:45:43,512 INFO L229 MonitoredProcess]: Starting monitored process 3 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:45:43,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 01:45:43,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:45:43,589 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 01:45:43,591 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:45:43,644 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 01:45:43,645 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:45:43,766 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 01:45:43,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [341627283] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 01:45:43,772 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 01:45:43,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 15 [2024-10-11 01:45:43,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476759625] [2024-10-11 01:45:43,773 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 01:45:43,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 01:45:43,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:45:43,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 01:45:43,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-10-11 01:45:43,774 INFO L87 Difference]: Start difference. First operand 60 states and 79 transitions. Second operand has 15 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 13 states have internal predecessors, (47), 2 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 01:45:43,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:45:43,969 INFO L93 Difference]: Finished difference Result 127 states and 167 transitions. [2024-10-11 01:45:43,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 01:45:43,969 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 13 states have internal predecessors, (47), 2 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2024-10-11 01:45:43,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:45:43,970 INFO L225 Difference]: With dead ends: 127 [2024-10-11 01:45:43,970 INFO L226 Difference]: Without dead ends: 76 [2024-10-11 01:45:43,970 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 62 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2024-10-11 01:45:43,971 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 25 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:45:43,971 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 337 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 01:45:43,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-10-11 01:45:43,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 64. [2024-10-11 01:45:43,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 57 states have (on average 1.2456140350877194) internal successors, (71), 57 states have internal predecessors, (71), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-10-11 01:45:43,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 83 transitions. [2024-10-11 01:45:43,977 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 83 transitions. Word has length 33 [2024-10-11 01:45:43,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:45:43,977 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 83 transitions. [2024-10-11 01:45:43,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 13 states have internal predecessors, (47), 2 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 01:45:43,977 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 83 transitions. [2024-10-11 01:45:43,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-11 01:45:43,978 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:45:43,978 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:45:43,994 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 01:45:44,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:45:44,182 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:45:44,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:45:44,182 INFO L85 PathProgramCache]: Analyzing trace with hash 756139205, now seen corresponding path program 2 times [2024-10-11 01:45:44,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:45:44,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486008675] [2024-10-11 01:45:44,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:45:44,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:45:44,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:45:44,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 01:45:44,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:45:44,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 01:45:44,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:45:44,404 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 01:45:44,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:45:44,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486008675] [2024-10-11 01:45:44,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486008675] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:45:44,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [397322982] [2024-10-11 01:45:44,404 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 01:45:44,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:45:44,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:45:44,405 INFO L229 MonitoredProcess]: Starting monitored process 4 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:45:44,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 01:45:44,490 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 01:45:44,490 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 01:45:44,491 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-11 01:45:44,493 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:45:44,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 01:45:44,631 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 24 treesize of output 16 [2024-10-11 01:45:44,635 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 20 treesize of output 12 [2024-10-11 01:45:44,640 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 16 treesize of output 8 [2024-10-11 01:45:44,642 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:45:44,642 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:45:44,667 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 25 treesize of output 17 [2024-10-11 01:45:44,670 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 21 treesize of output 13 [2024-10-11 01:45:44,685 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 01:45:44,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [397322982] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 01:45:44,686 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 01:45:44,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 9 [2024-10-11 01:45:44,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422357919] [2024-10-11 01:45:44,686 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 01:45:44,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 01:45:44,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:45:44,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 01:45:44,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 01:45:44,687 INFO L87 Difference]: Start difference. First operand 64 states and 83 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 01:45:48,709 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 01:45:52,733 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 01:45:56,784 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 01:46:00,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 01:46:04,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 01:46:08,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 01:46:12,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 01:46:12,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:46:12,920 INFO L93 Difference]: Finished difference Result 100 states and 126 transitions. [2024-10-11 01:46:12,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 01:46:12,924 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2024-10-11 01:46:12,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:46:12,925 INFO L225 Difference]: With dead ends: 100 [2024-10-11 01:46:12,925 INFO L226 Difference]: Without dead ends: 96 [2024-10-11 01:46:12,926 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-10-11 01:46:12,926 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 21 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 1 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.2s IncrementalHoareTripleChecker+Time [2024-10-11 01:46:12,927 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 277 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 150 Invalid, 7 Unknown, 0 Unchecked, 28.2s Time] [2024-10-11 01:46:12,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-11 01:46:12,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 77. [2024-10-11 01:46:12,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 68 states have (on average 1.2647058823529411) internal successors, (86), 69 states have internal predecessors, (86), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2024-10-11 01:46:12,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 98 transitions. [2024-10-11 01:46:12,935 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 98 transitions. Word has length 37 [2024-10-11 01:46:12,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:46:12,935 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 98 transitions. [2024-10-11 01:46:12,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 01:46:12,936 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 98 transitions. [2024-10-11 01:46:12,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-11 01:46:12,936 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:46:12,937 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:46:12,951 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 01:46:13,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:46:13,142 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:46:13,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:46:13,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1966046442, now seen corresponding path program 3 times [2024-10-11 01:46:13,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:46:13,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304221183] [2024-10-11 01:46:13,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:46:13,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:46:13,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:46:13,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 01:46:13,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:46:13,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 01:46:13,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:46:13,469 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-11 01:46:13,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:46:13,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304221183] [2024-10-11 01:46:13,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304221183] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:46:13,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447672533] [2024-10-11 01:46:13,470 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 01:46:13,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:46:13,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:46:13,472 INFO L229 MonitoredProcess]: Starting monitored process 5 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:46:13,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 01:46:13,548 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-11 01:46:13,548 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 01:46:13,549 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-11 01:46:13,553 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:46:13,644 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 01:46:13,644 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:46:13,866 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-11 01:46:13,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1447672533] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 01:46:13,867 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 01:46:13,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 14] total 24 [2024-10-11 01:46:13,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141827450] [2024-10-11 01:46:13,867 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 01:46:13,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-11 01:46:13,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:46:13,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-11 01:46:13,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=479, Unknown=0, NotChecked=0, Total=552 [2024-10-11 01:46:13,869 INFO L87 Difference]: Start difference. First operand 77 states and 98 transitions. Second operand has 24 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 21 states have internal predecessors, (54), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 01:46:14,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:46:14,145 INFO L93 Difference]: Finished difference Result 159 states and 209 transitions. [2024-10-11 01:46:14,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 01:46:14,145 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 21 states have internal predecessors, (54), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 38 [2024-10-11 01:46:14,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:46:14,147 INFO L225 Difference]: With dead ends: 159 [2024-10-11 01:46:14,147 INFO L226 Difference]: Without dead ends: 155 [2024-10-11 01:46:14,147 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=657, Unknown=0, NotChecked=0, Total=756 [2024-10-11 01:46:14,153 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 48 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 01:46:14,153 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 597 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 01:46:14,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-10-11 01:46:14,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 101. [2024-10-11 01:46:14,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 90 states have (on average 1.2333333333333334) internal successors, (111), 91 states have internal predecessors, (111), 6 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (12), 7 states have call predecessors, (12), 6 states have call successors, (12) [2024-10-11 01:46:14,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 129 transitions. [2024-10-11 01:46:14,179 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 129 transitions. Word has length 38 [2024-10-11 01:46:14,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:46:14,179 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 129 transitions. [2024-10-11 01:46:14,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 21 states have internal predecessors, (54), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 01:46:14,180 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 129 transitions. [2024-10-11 01:46:14,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-11 01:46:14,182 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:46:14,182 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:46:14,211 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 01:46:14,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-10-11 01:46:14,383 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:46:14,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:46:14,384 INFO L85 PathProgramCache]: Analyzing trace with hash 818465125, now seen corresponding path program 4 times [2024-10-11 01:46:14,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:46:14,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053674695] [2024-10-11 01:46:14,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:46:14,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:46:14,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:46:14,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 01:46:14,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:46:14,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 01:46:14,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:46:14,855 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 01:46:14,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:46:14,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053674695] [2024-10-11 01:46:14,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053674695] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:46:14,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1895534450] [2024-10-11 01:46:14,856 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-11 01:46:14,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:46:14,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:46:14,860 INFO L229 MonitoredProcess]: Starting monitored process 6 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:46:14,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 01:46:14,969 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-11 01:46:14,969 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 01:46:14,971 INFO L255 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-10-11 01:46:14,974 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:46:14,987 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:46:15,020 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:46:15,024 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:46:15,063 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 01:46:15,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-11 01:46:15,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-10-11 01:46:15,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-10-11 01:46:15,434 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 65 treesize of output 41 [2024-10-11 01:46:15,571 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:46:15,571 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:46:15,638 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 72 treesize of output 52 [2024-10-11 01:46:15,645 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 56 treesize of output 36 [2024-10-11 01:46:19,741 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| Int)) (or (= (select (select (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| (store (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25|) 0 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset|) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25|) 0)))) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| Int)) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25|) 0 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset|) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25|) 0))))) is different from false [2024-10-11 01:46:19,933 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 4 not checked. [2024-10-11 01:46:19,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1895534450] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 01:46:19,933 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 01:46:19,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 11] total 22 [2024-10-11 01:46:19,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55779465] [2024-10-11 01:46:19,933 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 01:46:19,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-11 01:46:19,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:46:19,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-11 01:46:19,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=368, Unknown=1, NotChecked=38, Total=462 [2024-10-11 01:46:19,935 INFO L87 Difference]: Start difference. First operand 101 states and 129 transitions. Second operand has 22 states, 22 states have (on average 2.6818181818181817) internal successors, (59), 22 states have internal predecessors, (59), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 01:46:24,035 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| Int)) (or (= (select (select (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| (store (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25|) 0 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset|) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25|) 0)))) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| Int)) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25|) 0 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset|) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25|) 0)))) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)) is different from false [2024-10-11 01:46:24,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:46:24,398 INFO L93 Difference]: Finished difference Result 164 states and 205 transitions. [2024-10-11 01:46:24,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 01:46:24,399 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.6818181818181817) internal successors, (59), 22 states have internal predecessors, (59), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 39 [2024-10-11 01:46:24,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:46:24,400 INFO L225 Difference]: With dead ends: 164 [2024-10-11 01:46:24,400 INFO L226 Difference]: Without dead ends: 151 [2024-10-11 01:46:24,400 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=77, Invalid=481, Unknown=2, NotChecked=90, Total=650 [2024-10-11 01:46:24,401 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 21 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 01:46:24,401 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 560 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 357 Invalid, 0 Unknown, 90 Unchecked, 0.3s Time] [2024-10-11 01:46:24,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-10-11 01:46:24,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 137. [2024-10-11 01:46:24,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 121 states have (on average 1.2396694214876034) internal successors, (150), 124 states have internal predecessors, (150), 9 states have call successors, (9), 3 states have call predecessors, (9), 6 states have return successors, (17), 9 states have call predecessors, (17), 9 states have call successors, (17) [2024-10-11 01:46:24,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 176 transitions. [2024-10-11 01:46:24,423 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 176 transitions. Word has length 39 [2024-10-11 01:46:24,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:46:24,423 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 176 transitions. [2024-10-11 01:46:24,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.6818181818181817) internal successors, (59), 22 states have internal predecessors, (59), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 01:46:24,424 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 176 transitions. [2024-10-11 01:46:24,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-11 01:46:24,425 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:46:24,425 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:46:24,443 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 01:46:24,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:46:24,625 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:46:24,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:46:24,626 INFO L85 PathProgramCache]: Analyzing trace with hash 160286352, now seen corresponding path program 1 times [2024-10-11 01:46:24,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:46:24,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256810733] [2024-10-11 01:46:24,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:46:24,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:46:24,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:46:24,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 01:46:24,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:46:24,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 01:46:24,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:46:24,941 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 01:46:24,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:46:24,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256810733] [2024-10-11 01:46:24,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256810733] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:46:24,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046412318] [2024-10-11 01:46:24,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:46:24,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:46:24,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:46:24,946 INFO L229 MonitoredProcess]: Starting monitored process 7 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:46:24,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 01:46:25,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:46:25,036 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-11 01:46:25,039 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:46:25,212 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 01:46:25,212 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:46:25,533 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 01:46:25,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2046412318] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 01:46:25,533 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 01:46:25,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 24 [2024-10-11 01:46:25,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835554098] [2024-10-11 01:46:25,534 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 01:46:25,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-11 01:46:25,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:46:25,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-11 01:46:25,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=480, Unknown=0, NotChecked=0, Total=552 [2024-10-11 01:46:25,535 INFO L87 Difference]: Start difference. First operand 137 states and 176 transitions. Second operand has 24 states, 21 states have (on average 3.0476190476190474) internal successors, (64), 22 states have internal predecessors, (64), 3 states have call successors, (3), 1 states have call predecessors, (3), 6 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-11 01:46:26,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:46:26,058 INFO L93 Difference]: Finished difference Result 300 states and 407 transitions. [2024-10-11 01:46:26,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 01:46:26,058 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 3.0476190476190474) internal successors, (64), 22 states have internal predecessors, (64), 3 states have call successors, (3), 1 states have call predecessors, (3), 6 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 41 [2024-10-11 01:46:26,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:46:26,060 INFO L225 Difference]: With dead ends: 300 [2024-10-11 01:46:26,060 INFO L226 Difference]: Without dead ends: 215 [2024-10-11 01:46:26,060 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=191, Invalid=931, Unknown=0, NotChecked=0, Total=1122 [2024-10-11 01:46:26,061 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 104 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 01:46:26,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 467 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 01:46:26,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-10-11 01:46:26,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 158. [2024-10-11 01:46:26,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 139 states have (on average 1.2805755395683454) internal successors, (178), 144 states have internal predecessors, (178), 9 states have call successors, (9), 4 states have call predecessors, (9), 9 states have return successors, (21), 9 states have call predecessors, (21), 9 states have call successors, (21) [2024-10-11 01:46:26,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 208 transitions. [2024-10-11 01:46:26,090 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 208 transitions. Word has length 41 [2024-10-11 01:46:26,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:46:26,091 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 208 transitions. [2024-10-11 01:46:26,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 3.0476190476190474) internal successors, (64), 22 states have internal predecessors, (64), 3 states have call successors, (3), 1 states have call predecessors, (3), 6 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-11 01:46:26,091 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 208 transitions. [2024-10-11 01:46:26,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-11 01:46:26,098 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:46:26,098 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:46:26,114 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-11 01:46:26,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-10-11 01:46:26,299 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:46:26,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:46:26,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1119577326, now seen corresponding path program 1 times [2024-10-11 01:46:26,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:46:26,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641106898] [2024-10-11 01:46:26,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:46:26,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:46:26,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 01:46:26,312 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 01:46:26,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 01:46:26,338 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 01:46:26,338 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 01:46:26,339 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 01:46:26,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 01:46:26,344 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1] [2024-10-11 01:46:26,375 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 01:46:26,377 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 01:46:26 BoogieIcfgContainer [2024-10-11 01:46:26,377 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 01:46:26,378 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 01:46:26,378 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 01:46:26,378 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 01:46:26,378 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:45:41" (3/4) ... [2024-10-11 01:46:26,379 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-11 01:46:26,428 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 01:46:26,428 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 01:46:26,429 INFO L158 Benchmark]: Toolchain (without parser) took 45897.61ms. Allocated memory was 163.6MB in the beginning and 314.6MB in the end (delta: 151.0MB). Free memory was 89.0MB in the beginning and 215.9MB in the end (delta: -126.9MB). Peak memory consumption was 26.9MB. Max. memory is 16.1GB. [2024-10-11 01:46:26,429 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 163.6MB. Free memory is still 113.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 01:46:26,429 INFO L158 Benchmark]: CACSL2BoogieTranslator took 518.70ms. Allocated memory was 163.6MB in the beginning and 255.9MB in the end (delta: 92.3MB). Free memory was 88.7MB in the beginning and 222.9MB in the end (delta: -134.3MB). Peak memory consumption was 24.1MB. Max. memory is 16.1GB. [2024-10-11 01:46:26,429 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.90ms. Allocated memory is still 255.9MB. Free memory was 222.9MB in the beginning and 219.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 01:46:26,429 INFO L158 Benchmark]: Boogie Preprocessor took 45.11ms. Allocated memory is still 255.9MB. Free memory was 219.8MB in the beginning and 217.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 01:46:26,429 INFO L158 Benchmark]: RCFGBuilder took 430.85ms. Allocated memory is still 255.9MB. Free memory was 217.7MB in the beginning and 195.4MB in the end (delta: 22.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-11 01:46:26,430 INFO L158 Benchmark]: TraceAbstraction took 44805.60ms. Allocated memory was 255.9MB in the beginning and 314.6MB in the end (delta: 58.7MB). Free memory was 195.4MB in the beginning and 219.1MB in the end (delta: -23.7MB). Peak memory consumption was 34.3MB. Max. memory is 16.1GB. [2024-10-11 01:46:26,430 INFO L158 Benchmark]: Witness Printer took 50.49ms. Allocated memory is still 314.6MB. Free memory was 219.1MB in the beginning and 215.9MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 01:46:26,433 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.15ms. Allocated memory is still 163.6MB. Free memory is still 113.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 518.70ms. Allocated memory was 163.6MB in the beginning and 255.9MB in the end (delta: 92.3MB). Free memory was 88.7MB in the beginning and 222.9MB in the end (delta: -134.3MB). Peak memory consumption was 24.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.90ms. Allocated memory is still 255.9MB. Free memory was 222.9MB in the beginning and 219.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.11ms. Allocated memory is still 255.9MB. Free memory was 219.8MB in the beginning and 217.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 430.85ms. Allocated memory is still 255.9MB. Free memory was 217.7MB in the beginning and 195.4MB in the end (delta: 22.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 44805.60ms. Allocated memory was 255.9MB in the beginning and 314.6MB in the end (delta: 58.7MB). Free memory was 195.4MB in the beginning and 219.1MB in the end (delta: -23.7MB). Peak memory consumption was 34.3MB. Max. memory is 16.1GB. * Witness Printer took 50.49ms. Allocated memory is still 314.6MB. Free memory was 219.1MB in the beginning and 215.9MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. 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: 641]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L627] CALL, EXPR _get_nondet_int(2, 5) VAL [\old(from)=2, \old(until)=5] [L620] int len = from; VAL [\old(from)=2, \old(until)=5, len=2, until=5] [L621] len < until && __VERIFIER_nondet_int() [L621] len < until && __VERIFIER_nondet_int() VAL [\old(from)=2, \old(until)=5, len=2, until=5] [L621] COND FALSE !(len < until && __VERIFIER_nondet_int()) [L624] return len; [L627] RET, EXPR _get_nondet_int(2, 5) [L627] const int len = _get_nondet_int(2, 5); [L628] SLL s = sll_create(len); [L628] CALL, EXPR sll_create(len) [L575] SLL head = ((void *)0); VAL [head={0:0}, len=2] [L576] EXPR len-- VAL [head={0:0}, len=1] [L576] COND TRUE len-- > 0 [L577] SLL new_head = (SLL) malloc(sizeof(struct node)); [L578] COND FALSE !(((void *)0) == new_head) VAL [head={0:0}, len=1, new_head={-1:0}] [L581] new_head->next = head [L582] head = new_head [L576] EXPR len-- VAL [head={-1:0}, len=0] [L576] COND TRUE len-- > 0 [L577] SLL new_head = (SLL) malloc(sizeof(struct node)); [L578] COND FALSE !(((void *)0) == new_head) VAL [head={-1:0}, len=0, new_head={-2:0}] [L581] new_head->next = head [L582] head = new_head [L576] EXPR len-- VAL [head={-2:0}, len=-1] [L576] COND FALSE !(len-- > 0) [L584] return head; [L628] RET, EXPR sll_create(len) [L628] SLL s = sll_create(len); [L629] CALL, EXPR _get_nondet_int(0, len - 1) VAL [\old(from)=0, \old(until)=1] [L620] int len = from; VAL [\old(from)=0, \old(until)=1, len=0, until=1] [L621] len < until && __VERIFIER_nondet_int() [L621] len < until && __VERIFIER_nondet_int() VAL [\old(from)=0, \old(until)=1, len=0, until=1] [L621] COND TRUE len < until && __VERIFIER_nondet_int() [L622] len++ VAL [\old(from)=0, \old(until)=1, len=1, until=1] [L621] len < until && __VERIFIER_nondet_int() VAL [\old(from)=0, \old(until)=1, len=1, until=1] [L621] COND FALSE !(len < until && __VERIFIER_nondet_int()) [L624] return len; [L629] RET, EXPR _get_nondet_int(0, len - 1) VAL [len=2, s={3:0}] [L629] const int k = _get_nondet_int(0, len - 1); [L630] int i = 0; VAL [i=0, k=1, len=2, s={3:0}] [L631] i < k && __VERIFIER_nondet_int() [L631] i < k && __VERIFIER_nondet_int() VAL [i=0, k=1, len=2, s={3:0}] [L631] COND FALSE !(i < k && __VERIFIER_nondet_int()) [L636] EXPR \read(s) [L636] CALL, EXPR sll_length(s) [L587] int len = 0; VAL [head={-2:0}, len=0] [L588] COND TRUE \read(head) [L589] len++ [L590] EXPR head->next [L590] head = head->next [L588] COND TRUE \read(head) [L589] len++ [L590] EXPR head->next [L590] head = head->next [L588] COND FALSE !(\read(head)) VAL [len=2] [L592] return len; [L636] RET, EXPR sll_length(s) [L636] COND TRUE k + len != sll_length(s) [L641] reach_error() VAL [i=0, s={3:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 43 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 44.7s, OverallIterations: 10, TraceHistogramMax: 3, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 34.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 7 mSolverCounterUnknown, 270 SdHoareTripleChecker+Valid, 29.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 261 mSDsluCounter, 2781 SdHoareTripleChecker+Invalid, 29.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 90 IncrementalHoareTripleChecker+Unchecked, 2457 mSDsCounter, 53 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1675 IncrementalHoareTripleChecker+Invalid, 1825 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 53 mSolverCounterUnsat, 324 mSDtfsCounter, 1675 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 538 GetRequests, 394 SyntacticMatches, 8 SemanticMatches, 136 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 467 ImplicationChecksByTransitivity, 9.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=158occurred in iteration=9, InterpolantAutomatonStates: 98, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 177 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 8.2s InterpolantComputationTime, 558 NumberOfCodeBlocks, 550 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 685 ConstructedInterpolants, 17 QuantifiedInterpolants, 4817 SizeOfPredicates, 27 NumberOfNonLiveVariables, 1077 ConjunctsInSsa, 158 ConjunctsInUnsatCore, 20 InterpolantComputations, 4 PerfectInterpolantSequences, 166/284 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:46:26,533 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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