./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-with-pointer/simple-recursive.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive-with-pointer/simple-recursive.c -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 e4b2b33802a1e3212162c0e55c40efaad08f7abe5e8690f0efef5fec80921b38 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 21:01:00,420 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 21:01:00,479 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 21:01:00,484 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 21:01:00,484 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 21:01:00,503 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 21:01:00,504 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 21:01:00,504 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 21:01:00,505 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 21:01:00,507 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 21:01:00,508 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 21:01:00,508 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 21:01:00,508 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 21:01:00,508 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 21:01:00,509 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 21:01:00,509 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 21:01:00,509 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 21:01:00,509 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 21:01:00,509 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 21:01:00,509 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 21:01:00,510 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 21:01:00,511 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 21:01:00,511 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 21:01:00,511 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 21:01:00,511 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 21:01:00,511 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 21:01:00,511 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 21:01:00,512 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 21:01:00,512 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 21:01:00,512 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 21:01:00,513 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 21:01:00,513 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 21:01:00,513 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 21:01:00,513 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 21:01:00,513 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 21:01:00,513 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 21:01:00,513 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 21:01:00,514 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 21:01:00,514 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 21:01:00,514 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 21:01:00,514 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 21:01:00,514 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 21:01:00,515 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 -> e4b2b33802a1e3212162c0e55c40efaad08f7abe5e8690f0efef5fec80921b38 [2024-11-11 21:01:00,738 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 21:01:00,761 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 21:01:00,764 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 21:01:00,765 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 21:01:00,765 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 21:01:00,766 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-with-pointer/simple-recursive.c [2024-11-11 21:01:01,952 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 21:01:02,099 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 21:01:02,100 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-with-pointer/simple-recursive.c [2024-11-11 21:01:02,105 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d04a8fb65/8b9223c8b2ad43ce9121ecab939688c9/FLAG54109249c [2024-11-11 21:01:02,115 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d04a8fb65/8b9223c8b2ad43ce9121ecab939688c9 [2024-11-11 21:01:02,118 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 21:01:02,119 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 21:01:02,120 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 21:01:02,120 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 21:01:02,125 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 21:01:02,125 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 09:01:02" (1/1) ... [2024-11-11 21:01:02,127 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36b6a544 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:01:02, skipping insertion in model container [2024-11-11 21:01:02,127 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 09:01:02" (1/1) ... [2024-11-11 21:01:02,140 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 21:01:02,282 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-with-pointer/simple-recursive.c[439,452] [2024-11-11 21:01:02,288 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 21:01:02,300 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 21:01:02,312 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-with-pointer/simple-recursive.c[439,452] [2024-11-11 21:01:02,315 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 21:01:02,329 INFO L204 MainTranslator]: Completed translation [2024-11-11 21:01:02,329 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:01:02 WrapperNode [2024-11-11 21:01:02,329 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 21:01:02,331 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 21:01:02,332 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 21:01:02,332 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 21:01:02,338 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:01:02" (1/1) ... [2024-11-11 21:01:02,343 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:01:02" (1/1) ... [2024-11-11 21:01:02,357 INFO L138 Inliner]: procedures = 14, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 17 [2024-11-11 21:01:02,357 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 21:01:02,358 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 21:01:02,358 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 21:01:02,358 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 21:01:02,366 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:01:02" (1/1) ... [2024-11-11 21:01:02,367 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:01:02" (1/1) ... [2024-11-11 21:01:02,368 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:01:02" (1/1) ... [2024-11-11 21:01:02,379 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 2 writes are split as follows [0, 2]. [2024-11-11 21:01:02,379 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:01:02" (1/1) ... [2024-11-11 21:01:02,380 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:01:02" (1/1) ... [2024-11-11 21:01:02,382 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:01:02" (1/1) ... [2024-11-11 21:01:02,383 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:01:02" (1/1) ... [2024-11-11 21:01:02,384 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:01:02" (1/1) ... [2024-11-11 21:01:02,384 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:01:02" (1/1) ... [2024-11-11 21:01:02,386 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 21:01:02,386 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 21:01:02,386 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 21:01:02,387 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 21:01:02,387 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:01:02" (1/1) ... [2024-11-11 21:01:02,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 21:01:02,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:01:02,437 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 21:01:02,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 21:01:02,508 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 21:01:02,509 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2024-11-11 21:01:02,509 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2024-11-11 21:01:02,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 21:01:02,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-11 21:01:02,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-11 21:01:02,510 INFO L130 BoogieDeclarations]: Found specification of procedure plus [2024-11-11 21:01:02,511 INFO L138 BoogieDeclarations]: Found implementation of procedure plus [2024-11-11 21:01:02,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-11 21:01:02,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-11 21:01:02,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 21:01:02,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 21:01:02,512 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-11 21:01:02,512 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-11 21:01:02,512 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-11 21:01:02,568 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 21:01:02,570 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 21:01:02,653 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-11 21:01:02,653 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 21:01:02,664 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 21:01:02,664 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-11 21:01:02,664 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 09:01:02 BoogieIcfgContainer [2024-11-11 21:01:02,665 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 21:01:02,671 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 21:01:02,671 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 21:01:02,674 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 21:01:02,675 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 09:01:02" (1/3) ... [2024-11-11 21:01:02,676 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44c27c74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 09:01:02, skipping insertion in model container [2024-11-11 21:01:02,676 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:01:02" (2/3) ... [2024-11-11 21:01:02,677 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44c27c74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 09:01:02, skipping insertion in model container [2024-11-11 21:01:02,677 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 09:01:02" (3/3) ... [2024-11-11 21:01:02,678 INFO L112 eAbstractionObserver]: Analyzing ICFG simple-recursive.c [2024-11-11 21:01:02,690 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 21:01:02,690 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 21:01:02,730 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 21:01:02,735 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;@1382d322, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 21:01:02,735 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 21:01:02,737 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-11 21:01:02,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-11 21:01:02,742 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:01:02,742 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:01:02,743 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting fooErr0ASSERT_VIOLATIONERROR_FUNCTION === [fooErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:01:02,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:01:02,747 INFO L85 PathProgramCache]: Analyzing trace with hash -694887038, now seen corresponding path program 1 times [2024-11-11 21:01:02,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:01:02,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571790496] [2024-11-11 21:01:02,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:01:02,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:01:02,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:01:03,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:01:03,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:01:03,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571790496] [2024-11-11 21:01:03,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571790496] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:01:03,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:01:03,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 21:01:03,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334220386] [2024-11-11 21:01:03,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:01:03,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:01:03,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:01:03,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:01:03,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:01:03,087 INFO L87 Difference]: Start difference. First operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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-11-11 21:01:03,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:01:03,157 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2024-11-11 21:01:03,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:01:03,159 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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 7 [2024-11-11 21:01:03,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:01:03,164 INFO L225 Difference]: With dead ends: 33 [2024-11-11 21:01:03,164 INFO L226 Difference]: Without dead ends: 14 [2024-11-11 21:01:03,166 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-11 21:01:03,170 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 2 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:01:03,171 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 58 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:01:03,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2024-11-11 21:01:03,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2024-11-11 21:01:03,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:01:03,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2024-11-11 21:01:03,198 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 7 [2024-11-11 21:01:03,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:01:03,198 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2024-11-11 21:01:03,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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-11-11 21:01:03,199 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2024-11-11 21:01:03,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-11 21:01:03,200 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:01:03,200 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:01:03,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 21:01:03,201 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting fooErr0ASSERT_VIOLATIONERROR_FUNCTION === [fooErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:01:03,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:01:03,202 INFO L85 PathProgramCache]: Analyzing trace with hash -2070363059, now seen corresponding path program 1 times [2024-11-11 21:01:03,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:01:03,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394318194] [2024-11-11 21:01:03,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:01:03,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:01:03,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:01:03,512 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:01:03,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:01:03,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394318194] [2024-11-11 21:01:03,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394318194] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:01:03,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1631077063] [2024-11-11 21:01:03,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:01:03,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:01:03,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:01:03,515 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:01:03,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-11 21:01:03,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:01:03,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-11 21:01:03,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:01:03,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-11 21:01:03,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-11 21:01:03,713 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:01:03,714 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:01:03,866 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:01:03,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1631077063] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:01:03,867 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:01:03,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 18 [2024-11-11 21:01:03,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80213490] [2024-11-11 21:01:03,868 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:01:03,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-11 21:01:03,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:01:03,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-11 21:01:03,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2024-11-11 21:01:03,872 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 18 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 12 states have internal predecessors, (18), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:01:04,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:01:04,044 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2024-11-11 21:01:04,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-11 21:01:04,045 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 12 states have internal predecessors, (18), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-11 21:01:04,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:01:04,046 INFO L225 Difference]: With dead ends: 28 [2024-11-11 21:01:04,046 INFO L226 Difference]: Without dead ends: 24 [2024-11-11 21:01:04,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=499, Unknown=0, NotChecked=0, Total=600 [2024-11-11 21:01:04,048 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 11 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:01:04,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 54 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:01:04,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-11 21:01:04,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2024-11-11 21:01:04,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 7 states have call successors, (7), 7 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:01:04,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2024-11-11 21:01:04,055 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 12 [2024-11-11 21:01:04,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:01:04,055 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2024-11-11 21:01:04,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 12 states have internal predecessors, (18), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:01:04,055 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2024-11-11 21:01:04,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-11 21:01:04,056 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:01:04,057 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2024-11-11 21:01:04,069 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-11 21:01:04,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:01:04,260 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting fooErr0ASSERT_VIOLATIONERROR_FUNCTION === [fooErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:01:04,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:01:04,262 INFO L85 PathProgramCache]: Analyzing trace with hash -978155155, now seen corresponding path program 2 times [2024-11-11 21:01:04,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:01:04,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956842228] [2024-11-11 21:01:04,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:01:04,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:01:04,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:01:04,768 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:01:04,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:01:04,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956842228] [2024-11-11 21:01:04,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956842228] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:01:04,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [568543016] [2024-11-11 21:01:04,769 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-11 21:01:04,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:01:04,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:01:04,772 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:01:04,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-11 21:01:04,830 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-11 21:01:04,830 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 21:01:04,834 WARN L254 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 91 conjuncts are in the unsatisfiable core [2024-11-11 21:01:04,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:01:04,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-11 21:01:04,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-11 21:01:05,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-11 21:01:05,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-11 21:01:05,192 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:01:05,193 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:01:05,541 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:01:05,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [568543016] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:01:05,541 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:01:05,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 18] total 48 [2024-11-11 21:01:05,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175776480] [2024-11-11 21:01:05,542 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:01:05,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-11-11 21:01:05,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:01:05,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-11-11 21:01:05,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=1995, Unknown=0, NotChecked=0, Total=2256 [2024-11-11 21:01:05,544 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand has 48 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 27 states have internal predecessors, (40), 21 states have call successors, (21), 21 states have call predecessors, (21), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:01:05,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:01:05,991 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2024-11-11 21:01:05,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-11-11 21:01:05,992 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 27 states have internal predecessors, (40), 21 states have call successors, (21), 21 states have call predecessors, (21), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-11 21:01:05,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:01:05,993 INFO L225 Difference]: With dead ends: 48 [2024-11-11 21:01:05,993 INFO L226 Difference]: Without dead ends: 44 [2024-11-11 21:01:05,994 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1480 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=564, Invalid=3858, Unknown=0, NotChecked=0, Total=4422 [2024-11-11 21:01:05,995 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 23 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:01:05,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 69 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:01:05,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-11 21:01:06,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2024-11-11 21:01:06,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 15 states have call successors, (15), 15 states have call predecessors, (15), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:01:06,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2024-11-11 21:01:06,008 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 22 [2024-11-11 21:01:06,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:01:06,008 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2024-11-11 21:01:06,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 27 states have internal predecessors, (40), 21 states have call successors, (21), 21 states have call predecessors, (21), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:01:06,008 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2024-11-11 21:01:06,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-11 21:01:06,009 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:01:06,009 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1] [2024-11-11 21:01:06,021 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-11 21:01:06,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-11 21:01:06,209 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting fooErr0ASSERT_VIOLATIONERROR_FUNCTION === [fooErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:01:06,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:01:06,210 INFO L85 PathProgramCache]: Analyzing trace with hash -665560147, now seen corresponding path program 3 times [2024-11-11 21:01:06,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:01:06,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946655863] [2024-11-11 21:01:06,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:01:06,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:01:06,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:01:07,211 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:01:07,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:01:07,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946655863] [2024-11-11 21:01:07,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946655863] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:01:07,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804655732] [2024-11-11 21:01:07,212 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-11 21:01:07,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:01:07,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:01:07,215 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:01:07,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-11 21:01:07,286 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-11 21:01:07,287 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 21:01:07,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-11 21:01:07,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:01:07,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-11 21:01:07,456 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 37 proven. 1 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-11-11 21:01:07,456 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:01:07,649 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 37 proven. 1 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-11-11 21:01:07,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1804655732] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:01:07,650 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:01:07,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 9, 9] total 42 [2024-11-11 21:01:07,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014389996] [2024-11-11 21:01:07,651 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:01:07,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-11 21:01:07,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:01:07,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-11 21:01:07,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=1510, Unknown=0, NotChecked=0, Total=1722 [2024-11-11 21:01:07,653 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand has 42 states, 32 states have (on average 1.28125) internal successors, (41), 25 states have internal predecessors, (41), 18 states have call successors, (20), 18 states have call predecessors, (20), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:01:08,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:01:08,286 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2024-11-11 21:01:08,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-11-11 21:01:08,286 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 32 states have (on average 1.28125) internal successors, (41), 25 states have internal predecessors, (41), 18 states have call successors, (20), 18 states have call predecessors, (20), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2024-11-11 21:01:08,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:01:08,287 INFO L225 Difference]: With dead ends: 50 [2024-11-11 21:01:08,287 INFO L226 Difference]: Without dead ends: 0 [2024-11-11 21:01:08,288 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 71 SyntacticMatches, 4 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 891 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=682, Invalid=3874, Unknown=0, NotChecked=0, Total=4556 [2024-11-11 21:01:08,289 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 27 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:01:08,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 28 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:01:08,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-11 21:01:08,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-11 21:01:08,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:01:08,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-11 21:01:08,290 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 42 [2024-11-11 21:01:08,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:01:08,290 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-11 21:01:08,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 32 states have (on average 1.28125) internal successors, (41), 25 states have internal predecessors, (41), 18 states have call successors, (20), 18 states have call predecessors, (20), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:01:08,290 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-11 21:01:08,290 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-11 21:01:08,292 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fooErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-11 21:01:08,305 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-11 21:01:08,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:01:08,496 INFO L421 BasicCegarLoop]: Path program histogram: [3, 1] [2024-11-11 21:01:08,497 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-11 21:01:08,975 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-11 21:01:08,988 WARN L156 FloydHoareUtils]: Requires clause for foo contained old-variable. Original clause: (let ((.cse6 (select |#memory_int#1| |foo_#in~p.base|)) (.cse5 (select |old(#memory_int#1)| |foo_#in~p.base|))) (let ((.cse2 (select .cse5 0)) (.cse0 (not (= |foo_#in~p.offset| 0))) (.cse1 (select .cse6 0)) (.cse4 (select .cse6 |foo_#in~p.offset|)) (.cse3 (select .cse5 |foo_#in~p.offset|))) (and (or .cse0 (<= .cse1 12) (< 12 .cse2)) (<= .cse3 20) (or (not (= .cse3 10)) .cse0 (= .cse1 10)) (or (<= .cse4 16) (< 16 .cse3)) (or .cse0 (<= .cse1 11) (< 11 .cse2)) (or (< 13 .cse3) .cse0 (<= .cse1 13)) (or (<= .cse4 17) (< 17 .cse3)) (or (<= .cse4 14) (< 14 .cse3)) (<= .cse4 20) (or (<= .cse4 15) (< 15 .cse3))))) Eliminated clause: (let ((.cse6 (select |#memory_int#1| |foo_#in~p.base|))) (let ((.cse1 (select .cse6 |foo_#in~p.offset|))) (and (exists ((|old(#memory_int#1)| (Array Int (Array Int Int)))) (let ((.cse5 (select |old(#memory_int#1)| |foo_#in~p.base|))) (let ((.cse0 (select .cse5 |foo_#in~p.offset|)) (.cse4 (not (= |foo_#in~p.offset| 0))) (.cse3 (select .cse6 0)) (.cse2 (select .cse5 0))) (and (or (< 17 .cse0) (< .cse1 18)) (<= .cse0 20) (or (< 13 .cse2) (< .cse3 14) .cse4) (or .cse4 (< .cse3 12) (< 11 .cse2)) (or (< .cse1 15) (< 14 .cse0)) (or (< .cse1 16) (< 15 .cse0)) (or (< .cse1 17) (< 16 .cse0)) (or (not (= .cse2 10)) .cse4 (= .cse3 10)) (or .cse4 (< .cse3 13) (< 12 .cse2)))))) (<= .cse1 20)))) [2024-11-11 21:01:08,997 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-11 21:01:08,998 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-11 21:01:08,998 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-11 21:01:08,998 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~p!base,]]] [2024-11-11 21:01:09,000 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-11 21:01:09,000 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]] [2024-11-11 21:01:09,000 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]],[IdentifierExpression[#in~p!base,]]] [2024-11-11 21:01:09,009 WARN L156 FloydHoareUtils]: Requires clause for plus contained old-variable. Original clause: (let ((.cse4 (select |old(#memory_int#1)| |plus_#in~p.base|)) (.cse5 (select |#memory_int#1| |plus_#in~p.base|))) (let ((.cse0 (not (= |plus_#in~p.offset| 0))) (.cse1 (select .cse5 0)) (.cse2 (select .cse4 |plus_#in~p.offset|)) (.cse3 (select .cse5 |plus_#in~p.offset|))) (and (or .cse0 (<= .cse1 11) (< 11 .cse2)) (or (< 13 .cse2) (<= .cse3 13)) (or (not (= .cse2 10)) .cse0 (= 10 .cse1)) (or .cse0 (< 12 (select .cse4 0)) (<= .cse1 12)) (or (< 15 .cse2) (<= .cse3 15)) (or (<= .cse3 16) (< 16 .cse2)) (<= .cse2 19) (<= .cse3 19) (or (< 14 .cse2) (<= .cse3 14))))) Eliminated clause: (let ((.cse6 (select |#memory_int#1| |plus_#in~p.base|))) (let ((.cse1 (select .cse6 |plus_#in~p.offset|))) (and (exists ((|old(#memory_int#1)| (Array Int (Array Int Int)))) (let ((.cse5 (select |old(#memory_int#1)| |plus_#in~p.base|))) (let ((.cse0 (select .cse5 |plus_#in~p.offset|)) (.cse2 (select .cse6 0)) (.cse3 (not (= |plus_#in~p.offset| 0))) (.cse4 (select .cse5 0))) (and (or (< 16 .cse0) (< .cse1 17)) (or (< .cse2 13) .cse3 (< 12 .cse4)) (or (< .cse1 14) (< 13 .cse0)) (or (< 15 .cse0) (< .cse1 16)) (<= .cse0 19) (or .cse3 (not (= .cse4 10)) (= 10 .cse2)) (or (< 14 .cse0) (< .cse1 15)) (or (< .cse2 12) .cse3 (< 11 .cse4)))))) (<= .cse1 19)))) [2024-11-11 21:01:09,010 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-11 21:01:09,010 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-11 21:01:09,010 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-11 21:01:09,011 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~p!base,]]] [2024-11-11 21:01:09,011 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-11 21:01:09,011 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]] [2024-11-11 21:01:09,011 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]],[IdentifierExpression[#in~p!base,]]] [2024-11-11 21:01:09,011 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.11 09:01:09 BoogieIcfgContainer [2024-11-11 21:01:09,011 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-11 21:01:09,012 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-11 21:01:09,012 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-11 21:01:09,012 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-11 21:01:09,013 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 09:01:02" (3/4) ... [2024-11-11 21:01:09,018 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-11 21:01:09,021 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure foo [2024-11-11 21:01:09,022 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure plus [2024-11-11 21:01:09,024 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-11 21:01:09,025 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-11 21:01:09,025 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-11 21:01:09,025 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-11 21:01:09,087 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-11 21:01:09,087 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-11 21:01:09,087 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-11 21:01:09,088 INFO L158 Benchmark]: Toolchain (without parser) took 6968.67ms. Allocated memory was 176.2MB in the beginning and 272.6MB in the end (delta: 96.5MB). Free memory was 108.0MB in the beginning and 101.2MB in the end (delta: 6.8MB). Peak memory consumption was 104.6MB. Max. memory is 16.1GB. [2024-11-11 21:01:09,088 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 176.2MB. Free memory was 134.0MB in the beginning and 133.8MB in the end (delta: 160.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 21:01:09,088 INFO L158 Benchmark]: CACSL2BoogieTranslator took 209.86ms. Allocated memory is still 176.2MB. Free memory was 107.8MB in the beginning and 95.8MB in the end (delta: 12.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-11 21:01:09,088 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.93ms. Allocated memory is still 176.2MB. Free memory was 95.8MB in the beginning and 94.5MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-11 21:01:09,089 INFO L158 Benchmark]: Boogie Preprocessor took 27.95ms. Allocated memory is still 176.2MB. Free memory was 94.3MB in the beginning and 92.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-11 21:01:09,089 INFO L158 Benchmark]: RCFGBuilder took 278.38ms. Allocated memory is still 176.2MB. Free memory was 92.5MB in the beginning and 139.3MB in the end (delta: -46.8MB). Peak memory consumption was 6.0MB. Max. memory is 16.1GB. [2024-11-11 21:01:09,089 INFO L158 Benchmark]: TraceAbstraction took 6340.47ms. Allocated memory was 176.2MB in the beginning and 272.6MB in the end (delta: 96.5MB). Free memory was 138.6MB in the beginning and 105.4MB in the end (delta: 33.3MB). Peak memory consumption was 132.2MB. Max. memory is 16.1GB. [2024-11-11 21:01:09,089 INFO L158 Benchmark]: Witness Printer took 75.23ms. Allocated memory is still 272.6MB. Free memory was 105.4MB in the beginning and 101.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-11 21:01:09,090 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.16ms. Allocated memory is still 176.2MB. Free memory was 134.0MB in the beginning and 133.8MB in the end (delta: 160.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 209.86ms. Allocated memory is still 176.2MB. Free memory was 107.8MB in the beginning and 95.8MB in the end (delta: 12.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.93ms. Allocated memory is still 176.2MB. Free memory was 95.8MB in the beginning and 94.5MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.95ms. Allocated memory is still 176.2MB. Free memory was 94.3MB in the beginning and 92.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 278.38ms. Allocated memory is still 176.2MB. Free memory was 92.5MB in the beginning and 139.3MB in the end (delta: -46.8MB). Peak memory consumption was 6.0MB. Max. memory is 16.1GB. * TraceAbstraction took 6340.47ms. Allocated memory was 176.2MB in the beginning and 272.6MB in the end (delta: 96.5MB). Free memory was 138.6MB in the beginning and 105.4MB in the end (delta: 33.3MB). Peak memory consumption was 132.2MB. Max. memory is 16.1GB. * Witness Printer took 75.23ms. Allocated memory is still 272.6MB. Free memory was 105.4MB in the beginning and 101.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~p!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]],[IdentifierExpression[#in~p!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~p!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]],[IdentifierExpression[#in~p!base,]]] * 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 - PositiveResult [Line: 18]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.8s, OverallIterations: 4, TraceHistogramMax: 8, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 63 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 63 mSDsluCounter, 209 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 172 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 437 IncrementalHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 37 mSDtfsCounter, 437 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 263 GetRequests, 101 SyntacticMatches, 4 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2436 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=3, InterpolantAutomatonStates: 104, 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, 4 MinimizatonAttempts, 3 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 159 NumberOfCodeBlocks, 134 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 225 ConstructedInterpolants, 0 QuantifiedInterpolants, 1146 SizeOfPredicates, 39 NumberOfNonLiveVariables, 366 ConjunctsInSsa, 166 ConjunctsInUnsatCore, 10 InterpolantComputations, 1 PerfectInterpolantSequences, 236/426 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-11 21:01:09,113 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 Result: TRUE