./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/alt_test.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/alt_test.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 6bafd9f9c248bc8b929fd553117dceb5cafdbf12cfc108f50311933c849ac186 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 01:42:26,922 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 01:42:26,974 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 01:42:26,978 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 01:42:26,979 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 01:42:27,000 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 01:42:27,000 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 01:42:27,001 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 01:42:27,001 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 01:42:27,002 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 01:42:27,002 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 01:42:27,002 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 01:42:27,003 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 01:42:27,003 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 01:42:27,004 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 01:42:27,005 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 01:42:27,005 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 01:42:27,005 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 01:42:27,005 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 01:42:27,005 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 01:42:27,006 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 01:42:27,008 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 01:42:27,009 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 01:42:27,009 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 01:42:27,009 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 01:42:27,009 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 01:42:27,009 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 01:42:27,009 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 01:42:27,010 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 01:42:27,010 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 01:42:27,010 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 01:42:27,010 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 01:42:27,010 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 01:42:27,010 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 01:42:27,010 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 01:42:27,010 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 01:42:27,011 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 01:42:27,011 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 01:42:27,011 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 01:42:27,011 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 01:42:27,011 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 01:42:27,011 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 01:42:27,012 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 -> 6bafd9f9c248bc8b929fd553117dceb5cafdbf12cfc108f50311933c849ac186 [2024-10-14 01:42:27,194 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 01:42:27,211 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 01:42:27,213 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 01:42:27,215 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 01:42:27,215 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 01:42:27,216 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/alt_test.i [2024-10-14 01:42:28,394 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 01:42:28,563 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 01:42:28,563 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/alt_test.i [2024-10-14 01:42:28,572 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50d5f346b/9978393e3af548c7abc250bb7a6341ce/FLAG4a7442c77 [2024-10-14 01:42:28,582 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50d5f346b/9978393e3af548c7abc250bb7a6341ce [2024-10-14 01:42:28,585 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 01:42:28,586 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 01:42:28,588 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 01:42:28,588 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 01:42:28,592 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 01:42:28,593 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:42:28" (1/1) ... [2024-10-14 01:42:28,593 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@420a9d49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:42:28, skipping insertion in model container [2024-10-14 01:42:28,593 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:42:28" (1/1) ... [2024-10-14 01:42:28,622 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 01:42:28,836 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/alt_test.i[22285,22298] [2024-10-14 01:42:28,844 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 01:42:28,854 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 01:42:28,892 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/alt_test.i[22285,22298] [2024-10-14 01:42:28,894 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 01:42:28,916 INFO L204 MainTranslator]: Completed translation [2024-10-14 01:42:28,916 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:42:28 WrapperNode [2024-10-14 01:42:28,916 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 01:42:28,917 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 01:42:28,917 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 01:42:28,918 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 01:42:28,923 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:42:28" (1/1) ... [2024-10-14 01:42:28,931 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:42:28" (1/1) ... [2024-10-14 01:42:28,946 INFO L138 Inliner]: procedures = 121, calls = 13, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 35 [2024-10-14 01:42:28,946 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 01:42:28,947 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 01:42:28,947 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 01:42:28,947 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 01:42:28,954 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:42:28" (1/1) ... [2024-10-14 01:42:28,954 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:42:28" (1/1) ... [2024-10-14 01:42:28,956 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:42:28" (1/1) ... [2024-10-14 01:42:28,965 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]. [2024-10-14 01:42:28,965 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:42:28" (1/1) ... [2024-10-14 01:42:28,965 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:42:28" (1/1) ... [2024-10-14 01:42:28,967 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:42:28" (1/1) ... [2024-10-14 01:42:28,969 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:42:28" (1/1) ... [2024-10-14 01:42:28,969 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:42:28" (1/1) ... [2024-10-14 01:42:28,970 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:42:28" (1/1) ... [2024-10-14 01:42:28,971 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 01:42:28,972 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 01:42:28,972 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 01:42:28,972 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 01:42:28,973 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:42:28" (1/1) ... [2024-10-14 01:42:28,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 01:42:28,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:42:29,002 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-10-14 01:42:29,005 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-10-14 01:42:29,044 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-14 01:42:29,044 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 01:42:29,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 01:42:29,044 INFO L130 BoogieDeclarations]: Found specification of procedure l_free [2024-10-14 01:42:29,044 INFO L138 BoogieDeclarations]: Found implementation of procedure l_free [2024-10-14 01:42:29,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 01:42:29,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 01:42:29,045 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 01:42:29,134 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 01:42:29,136 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 01:42:29,221 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-14 01:42:29,221 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 01:42:29,252 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 01:42:29,253 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-14 01:42:29,254 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:42:29 BoogieIcfgContainer [2024-10-14 01:42:29,254 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 01:42:29,257 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 01:42:29,257 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 01:42:29,260 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 01:42:29,261 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 01:42:28" (1/3) ... [2024-10-14 01:42:29,261 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55246349 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:42:29, skipping insertion in model container [2024-10-14 01:42:29,262 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:42:28" (2/3) ... [2024-10-14 01:42:29,263 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55246349 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:42:29, skipping insertion in model container [2024-10-14 01:42:29,263 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:42:29" (3/3) ... [2024-10-14 01:42:29,264 INFO L112 eAbstractionObserver]: Analyzing ICFG alt_test.i [2024-10-14 01:42:29,277 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 01:42:29,278 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 01:42:29,333 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 01:42:29,337 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;@2bb962be, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 01:42:29,338 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 01:42:29,343 INFO L276 IsEmpty]: Start isEmpty. Operand has 14 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 01:42:29,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-14 01:42:29,349 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:42:29,350 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:42:29,350 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting l_freeErr0ASSERT_VIOLATIONERROR_FUNCTION === [l_freeErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:42:29,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:42:29,354 INFO L85 PathProgramCache]: Analyzing trace with hash -339788470, now seen corresponding path program 1 times [2024-10-14 01:42:29,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:42:29,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316150698] [2024-10-14 01:42:29,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:42:29,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:42:29,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:42:29,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:42:29,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:42:29,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316150698] [2024-10-14 01:42:29,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316150698] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 01:42:29,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 01:42:29,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 01:42:29,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875459678] [2024-10-14 01:42:29,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 01:42:29,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 01:42:29,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:42:29,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 01:42:29,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 01:42:29,539 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 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 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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) [2024-10-14 01:42:29,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:42:29,569 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2024-10-14 01:42:29,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 01:42:29,572 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 8 [2024-10-14 01:42:29,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:42:29,577 INFO L225 Difference]: With dead ends: 30 [2024-10-14 01:42:29,577 INFO L226 Difference]: Without dead ends: 18 [2024-10-14 01:42:29,579 INFO L431 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 [2024-10-14 01:42:29,582 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 2 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 01:42:29,583 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 20 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 01:42:29,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-10-14 01:42:29,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2024-10-14 01:42:29,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 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) [2024-10-14 01:42:29,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2024-10-14 01:42:29,608 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 8 [2024-10-14 01:42:29,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:42:29,608 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2024-10-14 01:42:29,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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) [2024-10-14 01:42:29,608 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2024-10-14 01:42:29,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-14 01:42:29,610 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:42:29,610 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:42:29,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 01:42:29,611 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting l_freeErr0ASSERT_VIOLATIONERROR_FUNCTION === [l_freeErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:42:29,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:42:29,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1435218892, now seen corresponding path program 1 times [2024-10-14 01:42:29,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:42:29,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746294023] [2024-10-14 01:42:29,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:42:29,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:42:29,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:42:29,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:42:29,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:42:29,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746294023] [2024-10-14 01:42:29,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746294023] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 01:42:29,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 01:42:29,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 01:42:29,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784142348] [2024-10-14 01:42:29,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 01:42:29,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 01:42:29,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:42:29,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 01:42:29,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 01:42:29,654 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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) [2024-10-14 01:42:29,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:42:29,670 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2024-10-14 01:42:29,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 01:42:29,670 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 8 [2024-10-14 01:42:29,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:42:29,671 INFO L225 Difference]: With dead ends: 25 [2024-10-14 01:42:29,671 INFO L226 Difference]: Without dead ends: 15 [2024-10-14 01:42:29,672 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10-14 01:42:29,672 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 1 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 01:42:29,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 18 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 01:42:29,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-10-14 01:42:29,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-10-14 01:42:29,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 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) [2024-10-14 01:42:29,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2024-10-14 01:42:29,677 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 8 [2024-10-14 01:42:29,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:42:29,678 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2024-10-14 01:42:29,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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) [2024-10-14 01:42:29,678 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2024-10-14 01:42:29,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-14 01:42:29,679 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:42:29,679 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:42:29,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 01:42:29,679 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting l_freeErr0ASSERT_VIOLATIONERROR_FUNCTION === [l_freeErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:42:29,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:42:29,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1439110821, now seen corresponding path program 1 times [2024-10-14 01:42:29,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:42:29,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819480793] [2024-10-14 01:42:29,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:42:29,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:42:29,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:42:29,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 01:42:29,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:42:29,848 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:42:29,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:42:29,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819480793] [2024-10-14 01:42:29,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819480793] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 01:42:29,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 01:42:29,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 01:42:29,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959136031] [2024-10-14 01:42:29,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 01:42:29,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 01:42:29,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:42:29,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 01:42:29,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 01:42:29,851 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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) [2024-10-14 01:42:29,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:42:29,899 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2024-10-14 01:42:29,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 01:42:29,900 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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 13 [2024-10-14 01:42:29,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:42:29,901 INFO L225 Difference]: With dead ends: 25 [2024-10-14 01:42:29,901 INFO L226 Difference]: Without dead ends: 15 [2024-10-14 01:42:29,901 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-14 01:42:29,902 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 11 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 01:42:29,902 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 18 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 01:42:29,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-10-14 01:42:29,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-10-14 01:42:29,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 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) [2024-10-14 01:42:29,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2024-10-14 01:42:29,906 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2024-10-14 01:42:29,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:42:29,906 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2024-10-14 01:42:29,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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) [2024-10-14 01:42:29,906 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2024-10-14 01:42:29,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-14 01:42:29,907 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:42:29,907 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:42:29,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 01:42:29,907 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting l_freeErr0ASSERT_VIOLATIONERROR_FUNCTION === [l_freeErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:42:29,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:42:29,907 INFO L85 PathProgramCache]: Analyzing trace with hash 418407634, now seen corresponding path program 1 times [2024-10-14 01:42:29,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:42:29,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073331645] [2024-10-14 01:42:29,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:42:29,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:42:29,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 01:42:29,917 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 01:42:29,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 01:42:29,937 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 01:42:29,938 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 01:42:29,939 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location l_freeErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 01:42:29,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 01:42:29,942 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-14 01:42:29,959 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 01:42:29,961 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 01:42:29 BoogieIcfgContainer [2024-10-14 01:42:29,961 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 01:42:29,964 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 01:42:29,964 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 01:42:29,964 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 01:42:29,964 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:42:29" (3/4) ... [2024-10-14 01:42:29,965 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-14 01:42:29,993 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 01:42:29,993 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 01:42:29,994 INFO L158 Benchmark]: Toolchain (without parser) took 1407.42ms. Allocated memory was 123.7MB in the beginning and 161.5MB in the end (delta: 37.7MB). Free memory was 53.8MB in the beginning and 109.0MB in the end (delta: -55.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 01:42:29,994 INFO L158 Benchmark]: CDTParser took 0.41ms. Allocated memory is still 123.7MB. Free memory is still 83.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 01:42:29,994 INFO L158 Benchmark]: CACSL2BoogieTranslator took 328.45ms. Allocated memory was 123.7MB in the beginning and 161.5MB in the end (delta: 37.7MB). Free memory was 53.8MB in the beginning and 123.5MB in the end (delta: -69.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-14 01:42:29,994 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.89ms. Allocated memory is still 161.5MB. Free memory was 123.5MB in the beginning and 121.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 01:42:29,994 INFO L158 Benchmark]: Boogie Preprocessor took 24.87ms. Allocated memory is still 161.5MB. Free memory was 121.4MB in the beginning and 120.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 01:42:29,995 INFO L158 Benchmark]: RCFGBuilder took 282.00ms. Allocated memory is still 161.5MB. Free memory was 120.3MB in the beginning and 107.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-14 01:42:29,995 INFO L158 Benchmark]: TraceAbstraction took 704.67ms. Allocated memory is still 161.5MB. Free memory was 106.7MB in the beginning and 111.1MB in the end (delta: -4.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 01:42:29,995 INFO L158 Benchmark]: Witness Printer took 29.83ms. Allocated memory is still 161.5MB. Free memory was 111.1MB in the beginning and 109.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 01:42:29,996 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.41ms. Allocated memory is still 123.7MB. Free memory is still 83.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 328.45ms. Allocated memory was 123.7MB in the beginning and 161.5MB in the end (delta: 37.7MB). Free memory was 53.8MB in the beginning and 123.5MB in the end (delta: -69.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.89ms. Allocated memory is still 161.5MB. Free memory was 123.5MB in the beginning and 121.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.87ms. Allocated memory is still 161.5MB. Free memory was 121.4MB in the beginning and 120.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 282.00ms. Allocated memory is still 161.5MB. Free memory was 120.3MB in the beginning and 107.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 704.67ms. Allocated memory is still 161.5MB. Free memory was 106.7MB in the beginning and 111.1MB in the end (delta: -4.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 29.83ms. Allocated memory is still 161.5MB. Free memory was 111.1MB in the beginning and 109.0MB 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: 516]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L518] int 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; [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, 14 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, 15 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14 mSDsluCounter, 56 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 31 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 57 IncrementalHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 25 mSDtfsCounter, 57 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17occurred 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.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 43 NumberOfCodeBlocks, 43 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 26 ConstructedInterpolants, 0 QuantifiedInterpolants, 60 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 RESULT: Ultimate proved your program to be incorrect! [2024-10-14 01:42:30,016 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