./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-properties/list_flag-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-properties/list_flag-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 643182475b6f3736876ef9d58257e821498e53d566e4d81dd06a8f042f299e0b --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 13:55:32,655 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 13:55:32,732 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 13:55:32,742 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 13:55:32,743 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 13:55:32,772 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 13:55:32,772 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 13:55:32,773 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 13:55:32,773 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 13:55:32,775 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 13:55:32,775 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 13:55:32,775 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 13:55:32,776 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 13:55:32,776 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 13:55:32,778 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 13:55:32,778 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 13:55:32,778 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 13:55:32,779 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 13:55:32,779 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 13:55:32,779 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 13:55:32,779 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 13:55:32,780 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 13:55:32,780 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 13:55:32,781 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 13:55:32,781 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 13:55:32,781 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 13:55:32,781 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 13:55:32,782 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 13:55:32,782 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 13:55:32,782 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 13:55:32,783 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 13:55:32,783 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 13:55:32,783 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 13:55:32,784 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 13:55:32,784 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 13:55:32,784 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 13:55:32,784 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 13:55:32,785 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 13:55:32,785 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 13:55:32,785 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 13:55:32,786 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 13:55:32,786 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 13:55:32,786 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 643182475b6f3736876ef9d58257e821498e53d566e4d81dd06a8f042f299e0b [2024-11-08 13:55:33,019 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 13:55:33,041 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 13:55:33,044 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 13:55:33,045 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 13:55:33,046 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 13:55:33,047 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-properties/list_flag-1.i [2024-11-08 13:55:34,478 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 13:55:34,713 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 13:55:34,714 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list_flag-1.i [2024-11-08 13:55:34,730 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8eacd6419/2da08f336bc848e6a4b02a1dee565573/FLAG50e014530 [2024-11-08 13:55:34,743 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8eacd6419/2da08f336bc848e6a4b02a1dee565573 [2024-11-08 13:55:34,745 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 13:55:34,746 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 13:55:34,747 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 13:55:34,747 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 13:55:34,752 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 13:55:34,753 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 01:55:34" (1/1) ... [2024-11-08 13:55:34,754 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@581d9e57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:55:34, skipping insertion in model container [2024-11-08 13:55:34,754 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 01:55:34" (1/1) ... [2024-11-08 13:55:34,786 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 13:55:35,103 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list_flag-1.i[23375,23388] [2024-11-08 13:55:35,109 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 13:55:35,117 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 13:55:35,160 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list_flag-1.i[23375,23388] [2024-11-08 13:55:35,161 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 13:55:35,196 INFO L204 MainTranslator]: Completed translation [2024-11-08 13:55:35,197 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:55:35 WrapperNode [2024-11-08 13:55:35,197 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 13:55:35,198 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 13:55:35,199 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 13:55:35,200 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 13:55:35,207 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:55:35" (1/1) ... [2024-11-08 13:55:35,226 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:55:35" (1/1) ... [2024-11-08 13:55:35,253 INFO L138 Inliner]: procedures = 124, calls = 20, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 69 [2024-11-08 13:55:35,254 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 13:55:35,255 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 13:55:35,255 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 13:55:35,255 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 13:55:35,264 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:55:35" (1/1) ... [2024-11-08 13:55:35,265 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:55:35" (1/1) ... [2024-11-08 13:55:35,268 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:55:35" (1/1) ... [2024-11-08 13:55:35,287 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 4 writes are split as follows [0, 4]. [2024-11-08 13:55:35,287 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:55:35" (1/1) ... [2024-11-08 13:55:35,288 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:55:35" (1/1) ... [2024-11-08 13:55:35,300 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:55:35" (1/1) ... [2024-11-08 13:55:35,304 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:55:35" (1/1) ... [2024-11-08 13:55:35,307 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:55:35" (1/1) ... [2024-11-08 13:55:35,312 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:55:35" (1/1) ... [2024-11-08 13:55:35,314 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 13:55:35,319 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 13:55:35,319 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 13:55:35,319 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 13:55:35,320 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:55:35" (1/1) ... [2024-11-08 13:55:35,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 13:55:35,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:55:35,354 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 13:55:35,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 13:55:35,396 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-11-08 13:55:35,396 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-11-08 13:55:35,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-08 13:55:35,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-08 13:55:35,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-08 13:55:35,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-08 13:55:35,397 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-08 13:55:35,397 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 13:55:35,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-08 13:55:35,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-08 13:55:35,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-08 13:55:35,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-08 13:55:35,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 13:55:35,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 13:55:35,398 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 13:55:35,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 13:55:35,497 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 13:55:35,499 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 13:55:35,521 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-11-08 13:55:35,650 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-08 13:55:35,650 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 13:55:35,661 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 13:55:35,661 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-08 13:55:35,661 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 01:55:35 BoogieIcfgContainer [2024-11-08 13:55:35,661 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 13:55:35,664 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 13:55:35,664 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 13:55:35,667 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 13:55:35,667 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 01:55:34" (1/3) ... [2024-11-08 13:55:35,668 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@657efa02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 01:55:35, skipping insertion in model container [2024-11-08 13:55:35,668 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:55:35" (2/3) ... [2024-11-08 13:55:35,668 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@657efa02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 01:55:35, skipping insertion in model container [2024-11-08 13:55:35,669 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 01:55:35" (3/3) ... [2024-11-08 13:55:35,670 INFO L112 eAbstractionObserver]: Analyzing ICFG list_flag-1.i [2024-11-08 13:55:35,684 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 13:55:35,684 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 13:55:35,756 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 13:55:35,763 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;@4a56eafb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 13:55:35,763 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 13:55:35,769 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 25 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 13:55:35,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-08 13:55:35,775 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:55:35,776 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:55:35,777 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:55:35,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:55:35,782 INFO L85 PathProgramCache]: Analyzing trace with hash 943582971, now seen corresponding path program 1 times [2024-11-08 13:55:35,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:55:35,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838346516] [2024-11-08 13:55:35,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:55:35,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:55:35,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:55:35,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:55:35,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:55:35,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838346516] [2024-11-08 13:55:35,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838346516] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:55:35,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:55:35,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 13:55:35,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893691714] [2024-11-08 13:55:35,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:55:36,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 13:55:36,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:55:36,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 13:55:36,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 13:55:36,030 INFO L87 Difference]: Start difference. First operand has 27 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 25 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 13:55:36,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:55:36,045 INFO L93 Difference]: Finished difference Result 40 states and 55 transitions. [2024-11-08 13:55:36,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 13:55:36,047 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-08 13:55:36,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:55:36,052 INFO L225 Difference]: With dead ends: 40 [2024-11-08 13:55:36,052 INFO L226 Difference]: Without dead ends: 20 [2024-11-08 13:55:36,055 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 13:55:36,059 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 13:55:36,060 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:55:36,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-08 13:55:36,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-11-08 13:55:36,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 13:55:36,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2024-11-08 13:55:36,087 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 11 [2024-11-08 13:55:36,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:55:36,088 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2024-11-08 13:55:36,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 13:55:36,088 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2024-11-08 13:55:36,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-08 13:55:36,089 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:55:36,089 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:55:36,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 13:55:36,090 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:55:36,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:55:36,091 INFO L85 PathProgramCache]: Analyzing trace with hash 267820561, now seen corresponding path program 1 times [2024-11-08 13:55:36,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:55:36,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297860342] [2024-11-08 13:55:36,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:55:36,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:55:36,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:55:36,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:55:36,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:55:36,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297860342] [2024-11-08 13:55:36,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297860342] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:55:36,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:55:36,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 13:55:36,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444620025] [2024-11-08 13:55:36,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:55:36,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 13:55:36,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:55:36,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 13:55:36,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 13:55:36,419 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 13:55:36,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:55:36,487 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2024-11-08 13:55:36,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 13:55:36,488 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-08 13:55:36,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:55:36,488 INFO L225 Difference]: With dead ends: 36 [2024-11-08 13:55:36,489 INFO L226 Difference]: Without dead ends: 32 [2024-11-08 13:55:36,490 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 13:55:36,491 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 8 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 13:55:36,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 53 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 13:55:36,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-08 13:55:36,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2024-11-08 13:55:36,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 13:55:36,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2024-11-08 13:55:36,503 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 13 [2024-11-08 13:55:36,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:55:36,504 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2024-11-08 13:55:36,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 13:55:36,504 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2024-11-08 13:55:36,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-08 13:55:36,505 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:55:36,505 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:55:36,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 13:55:36,506 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:55:36,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:55:36,508 INFO L85 PathProgramCache]: Analyzing trace with hash -273802420, now seen corresponding path program 1 times [2024-11-08 13:55:36,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:55:36,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347020495] [2024-11-08 13:55:36,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:55:36,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:55:36,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:55:36,698 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:55:36,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:55:36,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347020495] [2024-11-08 13:55:36,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347020495] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:55:36,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:55:36,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 13:55:36,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098894346] [2024-11-08 13:55:36,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:55:36,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 13:55:36,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:55:36,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 13:55:36,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 13:55:36,704 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 13:55:36,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:55:36,782 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2024-11-08 13:55:36,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 13:55:36,783 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-08 13:55:36,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:55:36,783 INFO L225 Difference]: With dead ends: 38 [2024-11-08 13:55:36,784 INFO L226 Difference]: Without dead ends: 30 [2024-11-08 13:55:36,785 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 13:55:36,786 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 8 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 13:55:36,788 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 56 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 13:55:36,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-08 13:55:36,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2024-11-08 13:55:36,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 13:55:36,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2024-11-08 13:55:36,796 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 15 [2024-11-08 13:55:36,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:55:36,796 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2024-11-08 13:55:36,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 13:55:36,797 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2024-11-08 13:55:36,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-08 13:55:36,798 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:55:36,798 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:55:36,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 13:55:36,799 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:55:36,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:55:36,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1517543941, now seen corresponding path program 1 times [2024-11-08 13:55:36,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:55:36,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241372177] [2024-11-08 13:55:36,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:55:36,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:55:36,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:55:36,922 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:55:36,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:55:36,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241372177] [2024-11-08 13:55:36,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241372177] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:55:36,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:55:36,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 13:55:36,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510174673] [2024-11-08 13:55:36,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:55:36,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 13:55:36,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:55:36,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 13:55:36,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 13:55:36,928 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 13:55:36,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:55:36,990 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2024-11-08 13:55:36,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 13:55:36,991 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-08 13:55:36,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:55:36,992 INFO L225 Difference]: With dead ends: 36 [2024-11-08 13:55:36,993 INFO L226 Difference]: Without dead ends: 26 [2024-11-08 13:55:36,994 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 13:55:36,994 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 6 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 13:55:36,995 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 60 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:55:36,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-08 13:55:37,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 22. [2024-11-08 13:55:37,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 13:55:37,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2024-11-08 13:55:37,004 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 15 [2024-11-08 13:55:37,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:55:37,004 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2024-11-08 13:55:37,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 13:55:37,005 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2024-11-08 13:55:37,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-08 13:55:37,005 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:55:37,006 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:55:37,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 13:55:37,006 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:55:37,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:55:37,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1906655974, now seen corresponding path program 1 times [2024-11-08 13:55:37,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:55:37,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200512881] [2024-11-08 13:55:37,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:55:37,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:55:37,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:55:37,059 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:55:37,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:55:37,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200512881] [2024-11-08 13:55:37,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200512881] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:55:37,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:55:37,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 13:55:37,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503115254] [2024-11-08 13:55:37,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:55:37,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 13:55:37,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:55:37,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 13:55:37,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 13:55:37,063 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 13:55:37,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:55:37,080 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2024-11-08 13:55:37,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 13:55:37,081 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-08 13:55:37,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:55:37,082 INFO L225 Difference]: With dead ends: 46 [2024-11-08 13:55:37,082 INFO L226 Difference]: Without dead ends: 30 [2024-11-08 13:55:37,082 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 13:55:37,083 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 1 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 13:55:37,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 44 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:55:37,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-08 13:55:37,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-08 13:55:37,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 13:55:37,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2024-11-08 13:55:37,089 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 19 [2024-11-08 13:55:37,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:55:37,089 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2024-11-08 13:55:37,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 13:55:37,089 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2024-11-08 13:55:37,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-08 13:55:37,090 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:55:37,092 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:55:37,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 13:55:37,093 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:55:37,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:55:37,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1462919029, now seen corresponding path program 1 times [2024-11-08 13:55:37,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:55:37,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616737154] [2024-11-08 13:55:37,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:55:37,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:55:37,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 13:55:37,115 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 13:55:37,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 13:55:37,152 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 13:55:37,155 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 13:55:37,157 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 13:55:37,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 13:55:37,164 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-08 13:55:37,189 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 13:55:37,195 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 01:55:37 BoogieIcfgContainer [2024-11-08 13:55:37,195 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 13:55:37,196 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 13:55:37,196 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 13:55:37,196 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 13:55:37,197 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 01:55:35" (3/4) ... [2024-11-08 13:55:37,197 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-08 13:55:37,240 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 13:55:37,243 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 13:55:37,244 INFO L158 Benchmark]: Toolchain (without parser) took 2497.85ms. Allocated memory was 167.8MB in the beginning and 245.4MB in the end (delta: 77.6MB). Free memory was 109.0MB in the beginning and 118.9MB in the end (delta: -9.8MB). Peak memory consumption was 69.2MB. Max. memory is 16.1GB. [2024-11-08 13:55:37,245 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 167.8MB. Free memory is still 130.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 13:55:37,245 INFO L158 Benchmark]: CACSL2BoogieTranslator took 450.37ms. Allocated memory is still 167.8MB. Free memory was 108.6MB in the beginning and 89.6MB in the end (delta: 19.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-08 13:55:37,246 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.43ms. Allocated memory is still 167.8MB. Free memory was 89.6MB in the beginning and 87.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 13:55:37,246 INFO L158 Benchmark]: Boogie Preprocessor took 63.02ms. Allocated memory is still 167.8MB. Free memory was 87.6MB in the beginning and 85.4MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 13:55:37,246 INFO L158 Benchmark]: RCFGBuilder took 343.02ms. Allocated memory is still 167.8MB. Free memory was 85.4MB in the beginning and 71.2MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 13:55:37,246 INFO L158 Benchmark]: TraceAbstraction took 1532.04ms. Allocated memory was 167.8MB in the beginning and 245.4MB in the end (delta: 77.6MB). Free memory was 70.7MB in the beginning and 121.0MB in the end (delta: -50.2MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-08 13:55:37,247 INFO L158 Benchmark]: Witness Printer took 47.49ms. Allocated memory is still 245.4MB. Free memory was 121.0MB in the beginning and 118.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 13:55:37,248 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.20ms. Allocated memory is still 167.8MB. Free memory is still 130.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 450.37ms. Allocated memory is still 167.8MB. Free memory was 108.6MB in the beginning and 89.6MB in the end (delta: 19.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.43ms. Allocated memory is still 167.8MB. Free memory was 89.6MB in the beginning and 87.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.02ms. Allocated memory is still 167.8MB. Free memory was 87.6MB in the beginning and 85.4MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 343.02ms. Allocated memory is still 167.8MB. Free memory was 85.4MB in the beginning and 71.2MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1532.04ms. Allocated memory was 167.8MB in the beginning and 245.4MB in the end (delta: 77.6MB). Free memory was 70.7MB in the beginning and 121.0MB in the end (delta: -50.2MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Witness Printer took 47.49ms. Allocated memory is still 245.4MB. Free memory was 121.0MB in the beginning and 118.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 557]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L532] int flag = __VERIFIER_nondet_int(); [L533] List p, a, t; [L534] a = (List) malloc(sizeof(struct node)) [L535] COND FALSE !(a == 0) VAL [a={-1:0}, flag=1] [L536] p = a VAL [a={-1:0}, flag=1, p={-1:0}] [L537] COND TRUE __VERIFIER_nondet_int() [L538] COND TRUE \read(flag) [L539] p->h = 1 [L543] t = (List) malloc(sizeof(struct node)) [L544] COND FALSE !(t == 0) VAL [a={-1:0}, flag=1, p={-1:0}, t={-2:0}] [L545] p->n = t [L546] EXPR p->n [L546] p = p->n [L537] COND FALSE !(__VERIFIER_nondet_int()) [L548] p->h = 3 [L549] p = a VAL [flag=1, p={-1:0}] [L550] COND TRUE \read(flag) [L551] EXPR p->h [L551] COND FALSE !(p->h == 2) [L556] EXPR p->h [L556] COND TRUE p->h != 3 [L557] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 23 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 23 mSDsluCounter, 246 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 137 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 122 IncrementalHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 109 mSDtfsCounter, 122 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=5, InterpolantAutomatonStates: 20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 12 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 92 NumberOfCodeBlocks, 92 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 68 ConstructedInterpolants, 0 QuantifiedInterpolants, 197 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 6/6 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-08 13:55:37,281 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE