./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-regression/alt_test.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-regression/alt_test.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 6bafd9f9c248bc8b929fd553117dceb5cafdbf12cfc108f50311933c849ac186 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 02:37:25,350 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 02:37:25,400 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 02:37:25,407 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 02:37:25,409 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 02:37:25,429 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 02:37:25,430 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 02:37:25,430 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 02:37:25,431 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 02:37:25,431 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 02:37:25,431 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 02:37:25,432 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 02:37:25,432 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 02:37:25,432 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 02:37:25,432 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 02:37:25,432 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 02:37:25,432 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 02:37:25,433 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 02:37:25,433 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 02:37:25,433 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 02:37:25,433 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 02:37:25,433 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 02:37:25,433 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 02:37:25,433 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 02:37:25,433 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 02:37:25,433 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 02:37:25,433 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 02:37:25,433 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 02:37:25,433 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 02:37:25,433 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 02:37:25,433 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 02:37:25,434 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 02:37:25,434 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:37:25,434 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 02:37:25,434 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 02:37:25,434 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 02:37:25,434 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 02:37:25,434 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:37:25,435 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 02:37:25,435 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 02:37:25,435 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 02:37:25,435 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 02:37:25,435 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 02:37:25,435 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 02:37:25,435 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 02:37:25,435 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 02:37:25,435 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 02:37:25,435 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 02:37:25,435 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> 6bafd9f9c248bc8b929fd553117dceb5cafdbf12cfc108f50311933c849ac186 [2025-01-09 02:37:25,658 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 02:37:25,668 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 02:37:25,669 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 02:37:25,670 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 02:37:25,671 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 02:37:25,671 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-regression/alt_test.i [2025-01-09 02:37:26,871 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5c1f9f208/1303d2073ca14f0fba319f2455a41feb/FLAG6397c3ded [2025-01-09 02:37:27,223 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 02:37:27,224 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-regression/alt_test.i [2025-01-09 02:37:27,236 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5c1f9f208/1303d2073ca14f0fba319f2455a41feb/FLAG6397c3ded [2025-01-09 02:37:27,447 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5c1f9f208/1303d2073ca14f0fba319f2455a41feb [2025-01-09 02:37:27,448 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 02:37:27,449 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 02:37:27,451 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 02:37:27,451 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 02:37:27,454 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 02:37:27,455 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:37:27" (1/1) ... [2025-01-09 02:37:27,455 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68ecaacb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:37:27, skipping insertion in model container [2025-01-09 02:37:27,455 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:37:27" (1/1) ... [2025-01-09 02:37:27,476 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 02:37:27,627 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-regression/alt_test.i[22285,22298] [2025-01-09 02:37:27,634 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 02:37:27,640 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 02:37:27,661 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-regression/alt_test.i[22285,22298] [2025-01-09 02:37:27,663 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 02:37:27,683 INFO L204 MainTranslator]: Completed translation [2025-01-09 02:37:27,685 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:37:27 WrapperNode [2025-01-09 02:37:27,685 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 02:37:27,686 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 02:37:27,686 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 02:37:27,686 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 02:37:27,690 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:37:27" (1/1) ... [2025-01-09 02:37:27,696 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:37:27" (1/1) ... [2025-01-09 02:37:27,705 INFO L138 Inliner]: procedures = 121, calls = 13, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 35 [2025-01-09 02:37:27,706 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 02:37:27,706 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 02:37:27,706 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 02:37:27,706 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 02:37:27,711 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:37:27" (1/1) ... [2025-01-09 02:37:27,711 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:37:27" (1/1) ... [2025-01-09 02:37:27,713 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:37:27" (1/1) ... [2025-01-09 02:37:27,719 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 02:37:27,719 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:37:27" (1/1) ... [2025-01-09 02:37:27,719 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:37:27" (1/1) ... [2025-01-09 02:37:27,721 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:37:27" (1/1) ... [2025-01-09 02:37:27,722 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:37:27" (1/1) ... [2025-01-09 02:37:27,723 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:37:27" (1/1) ... [2025-01-09 02:37:27,723 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:37:27" (1/1) ... [2025-01-09 02:37:27,724 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:37:27" (1/1) ... [2025-01-09 02:37:27,724 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 02:37:27,725 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 02:37:27,725 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 02:37:27,725 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 02:37:27,726 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:37:27" (1/1) ... [2025-01-09 02:37:27,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:37:27,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:37:27,753 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 02:37:27,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 02:37:27,769 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 02:37:27,769 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 02:37:27,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 02:37:27,769 INFO L130 BoogieDeclarations]: Found specification of procedure l_free [2025-01-09 02:37:27,770 INFO L138 BoogieDeclarations]: Found implementation of procedure l_free [2025-01-09 02:37:27,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 02:37:27,770 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 02:37:27,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 02:37:27,822 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 02:37:27,823 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 02:37:27,894 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-01-09 02:37:27,894 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 02:37:27,903 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 02:37:27,903 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 02:37:27,903 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:37:27 BoogieIcfgContainer [2025-01-09 02:37:27,903 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 02:37:27,905 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 02:37:27,905 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 02:37:27,908 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 02:37:27,908 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:37:27" (1/3) ... [2025-01-09 02:37:27,908 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a8b732c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:37:27, skipping insertion in model container [2025-01-09 02:37:27,909 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:37:27" (2/3) ... [2025-01-09 02:37:27,909 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a8b732c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:37:27, skipping insertion in model container [2025-01-09 02:37:27,909 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:37:27" (3/3) ... [2025-01-09 02:37:27,910 INFO L128 eAbstractionObserver]: Analyzing ICFG alt_test.i [2025-01-09 02:37:27,919 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 02:37:27,920 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG alt_test.i that has 2 procedures, 20 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-01-09 02:37:27,957 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 02:37:27,966 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;@162d60da, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 02:37:27,966 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 02:37:27,970 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 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) [2025-01-09 02:37:27,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-09 02:37:27,974 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:37:27,974 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:37:27,974 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting l_freeErr0ASSERT_VIOLATIONERROR_FUNCTION === [l_freeErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:37:27,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:37:27,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1030557677, now seen corresponding path program 1 times [2025-01-09 02:37:27,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:37:27,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924661686] [2025-01-09 02:37:27,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:37:27,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:37:28,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-09 02:37:28,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-09 02:37:28,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:37:28,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:37:28,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:37:28,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:37:28,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924661686] [2025-01-09 02:37:28,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924661686] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:37:28,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:37:28,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 02:37:28,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174529164] [2025-01-09 02:37:28,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:37:28,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 02:37:28,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:37:28,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 02:37:28,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 02:37:28,203 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 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) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:37:28,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:37:28,223 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2025-01-09 02:37:28,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 02:37:28,224 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-01-09 02:37:28,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:37:28,228 INFO L225 Difference]: With dead ends: 40 [2025-01-09 02:37:28,228 INFO L226 Difference]: Without dead ends: 22 [2025-01-09 02:37:28,230 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 02:37:28,231 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 2 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:37:28,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 38 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:37:28,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-01-09 02:37:28,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2025-01-09 02:37:28,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 02:37:28,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2025-01-09 02:37:28,251 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 10 [2025-01-09 02:37:28,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:37:28,251 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2025-01-09 02:37:28,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:37:28,251 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2025-01-09 02:37:28,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-09 02:37:28,252 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:37:28,252 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:37:28,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 02:37:28,252 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting l_freeErr0ASSERT_VIOLATIONERROR_FUNCTION === [l_freeErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:37:28,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:37:28,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1839904303, now seen corresponding path program 1 times [2025-01-09 02:37:28,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:37:28,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174746586] [2025-01-09 02:37:28,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:37:28,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:37:28,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-09 02:37:28,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-09 02:37:28,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:37:28,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:37:28,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:37:28,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:37:28,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174746586] [2025-01-09 02:37:28,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174746586] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:37:28,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:37:28,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 02:37:28,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865355700] [2025-01-09 02:37:28,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:37:28,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 02:37:28,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:37:28,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 02:37:28,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 02:37:28,286 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:37:28,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:37:28,292 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2025-01-09 02:37:28,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 02:37:28,292 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-01-09 02:37:28,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:37:28,293 INFO L225 Difference]: With dead ends: 30 [2025-01-09 02:37:28,293 INFO L226 Difference]: Without dead ends: 18 [2025-01-09 02:37:28,293 INFO L434 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 [2025-01-09 02:37:28,294 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 1 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:37:28,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 26 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:37:28,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-01-09 02:37:28,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2025-01-09 02:37:28,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 02:37:28,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2025-01-09 02:37:28,297 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 10 [2025-01-09 02:37:28,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:37:28,297 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2025-01-09 02:37:28,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:37:28,297 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2025-01-09 02:37:28,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-09 02:37:28,297 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:37:28,297 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:37:28,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 02:37:28,298 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting l_freeErr0ASSERT_VIOLATIONERROR_FUNCTION === [l_freeErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:37:28,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:37:28,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1999403131, now seen corresponding path program 1 times [2025-01-09 02:37:28,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:37:28,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020510095] [2025-01-09 02:37:28,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:37:28,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:37:28,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 02:37:28,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 02:37:28,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:37:28,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:37:28,422 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:37:28,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:37:28,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020510095] [2025-01-09 02:37:28,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020510095] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:37:28,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:37:28,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 02:37:28,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654474690] [2025-01-09 02:37:28,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:37:28,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 02:37:28,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:37:28,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 02:37:28,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 02:37:28,424 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 02:37:28,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:37:28,478 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2025-01-09 02:37:28,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 02:37:28,478 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2025-01-09 02:37:28,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:37:28,479 INFO L225 Difference]: With dead ends: 30 [2025-01-09 02:37:28,479 INFO L226 Difference]: Without dead ends: 18 [2025-01-09 02:37:28,479 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 02:37:28,480 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 5 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:37:28,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 47 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:37:28,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-01-09 02:37:28,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2025-01-09 02:37:28,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 02:37:28,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2025-01-09 02:37:28,485 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2025-01-09 02:37:28,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:37:28,486 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2025-01-09 02:37:28,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 02:37:28,486 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2025-01-09 02:37:28,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-01-09 02:37:28,487 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:37:28,487 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:37:28,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 02:37:28,488 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting l_freeErr0ASSERT_VIOLATIONERROR_FUNCTION === [l_freeErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:37:28,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:37:28,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1387459588, now seen corresponding path program 1 times [2025-01-09 02:37:28,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:37:28,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680022781] [2025-01-09 02:37:28,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:37:28,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:37:28,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 02:37:28,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 02:37:28,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:37:28,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 02:37:28,517 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 02:37:28,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 02:37:28,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 02:37:28,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:37:28,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 02:37:28,542 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 02:37:28,542 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 02:37:28,543 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location l_freeErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 02:37:28,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 02:37:28,549 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 02:37:28,565 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 02:37:28,567 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 02:37:28 BoogieIcfgContainer [2025-01-09 02:37:28,567 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 02:37:28,567 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 02:37:28,568 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 02:37:28,568 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 02:37:28,568 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:37:27" (3/4) ... [2025-01-09 02:37:28,569 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-09 02:37:28,595 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 10. [2025-01-09 02:37:28,625 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 02:37:28,625 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 02:37:28,625 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 02:37:28,626 INFO L158 Benchmark]: Toolchain (without parser) took 1176.22ms. Allocated memory is still 167.8MB. Free memory was 131.2MB in the beginning and 52.6MB in the end (delta: 78.6MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. [2025-01-09 02:37:28,626 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 209.7MB. Free memory is still 125.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 02:37:28,626 INFO L158 Benchmark]: CACSL2BoogieTranslator took 234.17ms. Allocated memory is still 167.8MB. Free memory was 131.2MB in the beginning and 114.5MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 02:37:28,626 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.18ms. Allocated memory is still 167.8MB. Free memory was 114.5MB in the beginning and 113.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 02:37:28,626 INFO L158 Benchmark]: Boogie Preprocessor took 18.39ms. Allocated memory is still 167.8MB. Free memory was 113.1MB in the beginning and 111.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 02:37:28,627 INFO L158 Benchmark]: RCFGBuilder took 178.66ms. Allocated memory is still 167.8MB. Free memory was 111.6MB in the beginning and 100.8MB in the end (delta: 10.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 02:37:28,627 INFO L158 Benchmark]: TraceAbstraction took 662.12ms. Allocated memory is still 167.8MB. Free memory was 100.2MB in the beginning and 58.0MB in the end (delta: 42.2MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-01-09 02:37:28,627 INFO L158 Benchmark]: Witness Printer took 57.65ms. Allocated memory is still 167.8MB. Free memory was 58.0MB in the beginning and 52.6MB in the end (delta: 5.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 02:37:28,628 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.18ms. Allocated memory is still 209.7MB. Free memory is still 125.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 234.17ms. Allocated memory is still 167.8MB. Free memory was 131.2MB in the beginning and 114.5MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.18ms. Allocated memory is still 167.8MB. Free memory was 114.5MB in the beginning and 113.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 18.39ms. Allocated memory is still 167.8MB. Free memory was 113.1MB in the beginning and 111.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 178.66ms. Allocated memory is still 167.8MB. Free memory was 111.6MB in the beginning and 100.8MB in the end (delta: 10.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 662.12ms. Allocated memory is still 167.8MB. Free memory was 100.2MB in the beginning and 58.0MB in the end (delta: 42.2MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Witness Printer took 57.65ms. Allocated memory is still 167.8MB. Free memory was 58.0MB in the beginning and 52.6MB in the end (delta: 5.4MB). There was no memory consumed. 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: 516]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L518] int globalState = 0; VAL [globalState=0] [L523] CALL, EXPR l_malloc(sizeof(int)) [L529] void *retVal = malloc(size); [L530] COND TRUE retVal != ((void *)0) [L531] globalState=1 VAL [globalState=1, retVal={-1:0}] [L532] return retVal; VAL [\result={-1:0}, globalState=1] [L523] RET, EXPR l_malloc(sizeof(int)) [L523] int *a = (int*) l_malloc(sizeof(int)); [L524] CALL l_free(a) VAL [\old(globalState)=1, globalState=1] [L535] COND TRUE ptr!=((void *)0) VAL [\old(globalState)=1, \old(ptr)={-1:0}, globalState=1] [L535] (globalState == 1) ? (0) : __blast_assert () VAL [\old(globalState)=1, \old(ptr)={-1:0}, globalState=1] [L536] globalState = 0 [L524] RET l_free(a) VAL [a={-1:0}, globalState=0] [L525] CALL l_free(a) VAL [\old(globalState)=0, globalState=0] [L535] COND TRUE ptr!=((void *)0) VAL [\old(globalState)=0, \old(ptr)={-1:0}, globalState=0] [L535] (globalState == 1) ? (0) : __blast_assert () [L535] CALL __blast_assert () [L516] reach_error() VAL [\old(globalState)=0, globalState=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8 mSDsluCounter, 111 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 66 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 45 IncrementalHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 45 mSDtfsCounter, 45 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=1, InterpolantAutomatonStates: 14, 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, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 53 NumberOfCodeBlocks, 53 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 33 ConstructedInterpolants, 0 QuantifiedInterpolants, 68 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 2/2 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-01-09 02:37:28,640 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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