./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-tiling/skippedu.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-tiling/skippedu.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 578aa1ed819483237cae7cb7b17bc18e9dfff9e081f63e5821fc4a918d7ba90e --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 09:56:43,196 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 09:56:43,248 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 09:56:43,252 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 09:56:43,253 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 09:56:43,275 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 09:56:43,276 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 09:56:43,276 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 09:56:43,277 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 09:56:43,278 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 09:56:43,278 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 09:56:43,278 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 09:56:43,278 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 09:56:43,279 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 09:56:43,279 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 09:56:43,279 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 09:56:43,279 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 09:56:43,280 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 09:56:43,280 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 09:56:43,280 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 09:56:43,284 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 09:56:43,284 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 09:56:43,285 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 09:56:43,285 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 09:56:43,285 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 09:56:43,285 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 09:56:43,285 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 09:56:43,285 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 09:56:43,286 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 09:56:43,286 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 09:56:43,286 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 09:56:43,286 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 09:56:43,286 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 09:56:43,286 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 09:56:43,287 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 09:56:43,287 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 09:56:43,287 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 09:56:43,287 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 09:56:43,287 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 09:56:43,287 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 09:56:43,288 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 09:56:43,289 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 09:56:43,289 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 -> 578aa1ed819483237cae7cb7b17bc18e9dfff9e081f63e5821fc4a918d7ba90e [2024-11-08 09:56:43,502 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 09:56:43,520 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 09:56:43,522 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 09:56:43,523 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 09:56:43,523 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 09:56:43,524 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-tiling/skippedu.c [2024-11-08 09:56:44,726 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 09:56:44,892 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 09:56:44,896 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/skippedu.c [2024-11-08 09:56:44,903 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/453a2c1c3/2d5e500e3993411e9d3f89f122feea0a/FLAGd4aeb034e [2024-11-08 09:56:45,297 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/453a2c1c3/2d5e500e3993411e9d3f89f122feea0a [2024-11-08 09:56:45,298 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 09:56:45,299 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 09:56:45,300 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 09:56:45,300 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 09:56:45,308 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 09:56:45,309 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:56:45" (1/1) ... [2024-11-08 09:56:45,309 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5043bad4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:56:45, skipping insertion in model container [2024-11-08 09:56:45,309 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:56:45" (1/1) ... [2024-11-08 09:56:45,326 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 09:56:45,468 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/array-tiling/skippedu.c[399,412] [2024-11-08 09:56:45,487 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 09:56:45,494 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 09:56:45,502 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/array-tiling/skippedu.c[399,412] [2024-11-08 09:56:45,511 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 09:56:45,527 INFO L204 MainTranslator]: Completed translation [2024-11-08 09:56:45,528 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:56:45 WrapperNode [2024-11-08 09:56:45,528 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 09:56:45,529 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 09:56:45,529 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 09:56:45,529 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 09:56:45,534 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:56:45" (1/1) ... [2024-11-08 09:56:45,539 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:56:45" (1/1) ... [2024-11-08 09:56:45,555 INFO L138 Inliner]: procedures = 16, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 76 [2024-11-08 09:56:45,555 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 09:56:45,556 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 09:56:45,557 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 09:56:45,557 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 09:56:45,569 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:56:45" (1/1) ... [2024-11-08 09:56:45,569 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:56:45" (1/1) ... [2024-11-08 09:56:45,570 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:56:45" (1/1) ... [2024-11-08 09:56:45,579 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 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2024-11-08 09:56:45,582 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:56:45" (1/1) ... [2024-11-08 09:56:45,582 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:56:45" (1/1) ... [2024-11-08 09:56:45,586 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:56:45" (1/1) ... [2024-11-08 09:56:45,588 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:56:45" (1/1) ... [2024-11-08 09:56:45,589 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:56:45" (1/1) ... [2024-11-08 09:56:45,590 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:56:45" (1/1) ... [2024-11-08 09:56:45,591 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 09:56:45,592 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 09:56:45,592 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 09:56:45,592 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 09:56:45,594 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:56:45" (1/1) ... [2024-11-08 09:56:45,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 09:56:45,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 09:56:45,620 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 09:56:45,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 09:56:45,652 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 09:56:45,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 09:56:45,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 09:56:45,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-08 09:56:45,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-08 09:56:45,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-08 09:56:45,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 09:56:45,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 09:56:45,654 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-08 09:56:45,654 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-08 09:56:45,707 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 09:56:45,708 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 09:56:45,860 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-11-08 09:56:45,861 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 09:56:45,869 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 09:56:45,869 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-08 09:56:45,870 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:56:45 BoogieIcfgContainer [2024-11-08 09:56:45,870 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 09:56:45,871 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 09:56:45,871 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 09:56:45,876 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 09:56:45,877 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 09:56:45" (1/3) ... [2024-11-08 09:56:45,877 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31ca4821 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:56:45, skipping insertion in model container [2024-11-08 09:56:45,877 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:56:45" (2/3) ... [2024-11-08 09:56:45,877 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31ca4821 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:56:45, skipping insertion in model container [2024-11-08 09:56:45,877 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:56:45" (3/3) ... [2024-11-08 09:56:45,878 INFO L112 eAbstractionObserver]: Analyzing ICFG skippedu.c [2024-11-08 09:56:45,890 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 09:56:45,890 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 09:56:45,931 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 09:56:45,936 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;@467af2b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 09:56:45,936 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 09:56:45,939 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 23 states have (on average 1.565217391304348) internal successors, (36), 24 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 09:56:45,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-08 09:56:45,943 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 09:56:45,943 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 09:56:45,943 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 09:56:45,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 09:56:45,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1607783550, now seen corresponding path program 1 times [2024-11-08 09:56:45,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 09:56:45,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609441508] [2024-11-08 09:56:45,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 09:56:45,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 09:56:46,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:56:46,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 09:56:46,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 09:56:46,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609441508] [2024-11-08 09:56:46,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609441508] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 09:56:46,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 09:56:46,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 09:56:46,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984332145] [2024-11-08 09:56:46,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 09:56:46,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 09:56:46,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 09:56:46,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 09:56:46,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 09:56:46,119 INFO L87 Difference]: Start difference. First operand has 25 states, 23 states have (on average 1.565217391304348) internal successors, (36), 24 states have internal predecessors, (36), 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) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 09:56:46,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 09:56:46,130 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2024-11-08 09:56:46,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 09:56:46,131 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-08 09:56:46,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 09:56:46,136 INFO L225 Difference]: With dead ends: 45 [2024-11-08 09:56:46,136 INFO L226 Difference]: Without dead ends: 20 [2024-11-08 09:56:46,138 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 09:56:46,140 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 09:56:46,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 09:56:46,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-08 09:56:46,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-11-08 09:56:46,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 09:56:46,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2024-11-08 09:56:46,160 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 12 [2024-11-08 09:56:46,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 09:56:46,160 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2024-11-08 09:56:46,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 09:56:46,160 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2024-11-08 09:56:46,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-08 09:56:46,161 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 09:56:46,161 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 09:56:46,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 09:56:46,161 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 09:56:46,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 09:56:46,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1872951298, now seen corresponding path program 1 times [2024-11-08 09:56:46,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 09:56:46,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347697989] [2024-11-08 09:56:46,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 09:56:46,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 09:56:46,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:56:46,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 09:56:46,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 09:56:46,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347697989] [2024-11-08 09:56:46,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347697989] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 09:56:46,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 09:56:46,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 09:56:46,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273862152] [2024-11-08 09:56:46,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 09:56:46,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 09:56:46,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 09:56:46,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 09:56:46,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 09:56:46,286 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 09:56:46,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 09:56:46,324 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2024-11-08 09:56:46,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 09:56:46,325 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-08 09:56:46,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 09:56:46,326 INFO L225 Difference]: With dead ends: 37 [2024-11-08 09:56:46,326 INFO L226 Difference]: Without dead ends: 22 [2024-11-08 09:56:46,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 09:56:46,328 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 1 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 27 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-08 09:56:46,329 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 27 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 09:56:46,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-08 09:56:46,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2024-11-08 09:56:46,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 09:56:46,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2024-11-08 09:56:46,333 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 12 [2024-11-08 09:56:46,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 09:56:46,333 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2024-11-08 09:56:46,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 09:56:46,334 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2024-11-08 09:56:46,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-08 09:56:46,334 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 09:56:46,334 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 09:56:46,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 09:56:46,334 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 09:56:46,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 09:56:46,335 INFO L85 PathProgramCache]: Analyzing trace with hash -270152420, now seen corresponding path program 1 times [2024-11-08 09:56:46,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 09:56:46,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353364733] [2024-11-08 09:56:46,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 09:56:46,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 09:56:46,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:56:46,436 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 09:56:46,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 09:56:46,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353364733] [2024-11-08 09:56:46,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353364733] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 09:56:46,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434801746] [2024-11-08 09:56:46,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 09:56:46,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 09:56:46,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 09:56:46,440 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-08 09:56:46,441 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-08 09:56:46,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:56:46,491 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 09:56:46,500 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 09:56:46,565 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 09:56:46,565 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 09:56:46,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 09:56:46,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1434801746] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 09:56:46,596 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 09:56:46,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-08 09:56:46,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290507506] [2024-11-08 09:56:46,596 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 09:56:46,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 09:56:46,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 09:56:46,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 09:56:46,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2024-11-08 09:56:46,600 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 09:56:46,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 09:56:46,650 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2024-11-08 09:56:46,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 09:56:46,650 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-08 09:56:46,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 09:56:46,651 INFO L225 Difference]: With dead ends: 39 [2024-11-08 09:56:46,651 INFO L226 Difference]: Without dead ends: 24 [2024-11-08 09:56:46,651 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2024-11-08 09:56:46,652 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 6 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 09:56:46,652 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 35 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 09:56:46,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-08 09:56:46,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2024-11-08 09:56:46,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 09:56:46,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2024-11-08 09:56:46,657 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 14 [2024-11-08 09:56:46,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 09:56:46,657 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2024-11-08 09:56:46,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 09:56:46,657 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2024-11-08 09:56:46,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-08 09:56:46,658 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 09:56:46,658 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 09:56:46,674 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-08 09:56:46,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 09:56:46,863 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 09:56:46,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 09:56:46,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1873689926, now seen corresponding path program 2 times [2024-11-08 09:56:46,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 09:56:46,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160412998] [2024-11-08 09:56:46,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 09:56:46,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 09:56:46,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:56:47,062 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 09:56:47,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 09:56:47,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160412998] [2024-11-08 09:56:47,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160412998] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 09:56:47,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 09:56:47,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 09:56:47,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541174062] [2024-11-08 09:56:47,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 09:56:47,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 09:56:47,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 09:56:47,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 09:56:47,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-08 09:56:47,068 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 09:56:47,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 09:56:47,115 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2024-11-08 09:56:47,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 09:56:47,116 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-08 09:56:47,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 09:56:47,116 INFO L225 Difference]: With dead ends: 35 [2024-11-08 09:56:47,117 INFO L226 Difference]: Without dead ends: 28 [2024-11-08 09:56:47,117 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-08 09:56:47,120 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 50 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 09:56:47,120 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 18 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 09:56:47,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-08 09:56:47,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2024-11-08 09:56:47,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 09:56:47,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2024-11-08 09:56:47,127 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 16 [2024-11-08 09:56:47,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 09:56:47,128 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2024-11-08 09:56:47,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 09:56:47,128 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2024-11-08 09:56:47,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-08 09:56:47,128 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 09:56:47,129 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 09:56:47,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 09:56:47,129 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 09:56:47,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 09:56:47,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1095507628, now seen corresponding path program 1 times [2024-11-08 09:56:47,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 09:56:47,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82906819] [2024-11-08 09:56:47,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 09:56:47,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 09:56:47,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:56:47,481 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 09:56:47,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 09:56:47,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82906819] [2024-11-08 09:56:47,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82906819] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 09:56:47,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [385394397] [2024-11-08 09:56:47,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 09:56:47,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 09:56:47,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 09:56:47,484 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-08 09:56:47,485 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-08 09:56:47,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:56:47,538 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-08 09:56:47,540 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 09:56:47,659 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-08 09:56:47,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-08 09:56:47,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-08 09:56:47,721 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 09:56:47,722 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 09:56:47,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2024-11-08 09:56:47,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2024-11-08 09:56:47,788 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 09:56:47,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [385394397] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 09:56:47,788 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 09:56:47,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 6] total 14 [2024-11-08 09:56:47,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342793453] [2024-11-08 09:56:47,789 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 09:56:47,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 09:56:47,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 09:56:47,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 09:56:47,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-11-08 09:56:47,791 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 09:56:47,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 09:56:47,970 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2024-11-08 09:56:47,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 09:56:47,971 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-08 09:56:47,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 09:56:47,971 INFO L225 Difference]: With dead ends: 57 [2024-11-08 09:56:47,971 INFO L226 Difference]: Without dead ends: 55 [2024-11-08 09:56:47,972 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2024-11-08 09:56:47,972 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 103 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 09:56:47,972 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 83 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 09:56:47,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-08 09:56:47,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 33. [2024-11-08 09:56:47,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.28125) internal successors, (41), 32 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 09:56:47,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2024-11-08 09:56:47,988 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 21 [2024-11-08 09:56:47,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 09:56:47,988 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2024-11-08 09:56:47,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 09:56:47,989 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2024-11-08 09:56:47,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-08 09:56:47,990 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 09:56:47,990 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 09:56:48,002 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-08 09:56:48,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 09:56:48,191 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 09:56:48,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 09:56:48,191 INFO L85 PathProgramCache]: Analyzing trace with hash -415449258, now seen corresponding path program 1 times [2024-11-08 09:56:48,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 09:56:48,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480761544] [2024-11-08 09:56:48,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 09:56:48,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 09:56:48,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 09:56:48,213 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 09:56:48,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 09:56:48,238 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 09:56:48,238 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 09:56:48,239 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 09:56:48,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 09:56:48,242 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1] [2024-11-08 09:56:48,264 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 09:56:48,267 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 09:56:48 BoogieIcfgContainer [2024-11-08 09:56:48,267 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 09:56:48,268 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 09:56:48,268 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 09:56:48,268 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 09:56:48,268 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:56:45" (3/4) ... [2024-11-08 09:56:48,269 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-08 09:56:48,305 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 09:56:48,308 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 09:56:48,308 INFO L158 Benchmark]: Toolchain (without parser) took 3009.12ms. Allocated memory was 188.7MB in the beginning and 226.5MB in the end (delta: 37.7MB). Free memory was 158.7MB in the beginning and 184.0MB in the end (delta: -25.3MB). Peak memory consumption was 12.0MB. Max. memory is 16.1GB. [2024-11-08 09:56:48,309 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 111.1MB. Free memory is still 81.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 09:56:48,309 INFO L158 Benchmark]: CACSL2BoogieTranslator took 228.24ms. Allocated memory is still 188.7MB. Free memory was 158.7MB in the beginning and 145.6MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 09:56:48,309 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.20ms. Allocated memory is still 188.7MB. Free memory was 145.6MB in the beginning and 143.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 09:56:48,309 INFO L158 Benchmark]: Boogie Preprocessor took 34.72ms. Allocated memory is still 188.7MB. Free memory was 143.5MB in the beginning and 142.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 09:56:48,309 INFO L158 Benchmark]: RCFGBuilder took 278.16ms. Allocated memory is still 188.7MB. Free memory was 141.4MB in the beginning and 153.1MB in the end (delta: -11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 09:56:48,310 INFO L158 Benchmark]: TraceAbstraction took 2396.21ms. Allocated memory was 188.7MB in the beginning and 226.5MB in the end (delta: 37.7MB). Free memory was 152.0MB in the beginning and 186.1MB in the end (delta: -34.1MB). Peak memory consumption was 5.8MB. Max. memory is 16.1GB. [2024-11-08 09:56:48,310 INFO L158 Benchmark]: Witness Printer took 40.33ms. Allocated memory is still 226.5MB. Free memory was 186.1MB in the beginning and 184.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 09:56:48,311 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 111.1MB. Free memory is still 81.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 228.24ms. Allocated memory is still 188.7MB. Free memory was 158.7MB in the beginning and 145.6MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.20ms. Allocated memory is still 188.7MB. Free memory was 145.6MB in the beginning and 143.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.72ms. Allocated memory is still 188.7MB. Free memory was 143.5MB in the beginning and 142.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 278.16ms. Allocated memory is still 188.7MB. Free memory was 141.4MB in the beginning and 153.1MB in the end (delta: -11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 2396.21ms. Allocated memory was 188.7MB in the beginning and 226.5MB in the end (delta: 37.7MB). Free memory was 152.0MB in the beginning and 186.1MB in the end (delta: -34.1MB). Peak memory consumption was 5.8MB. Max. memory is 16.1GB. * Witness Printer took 40.33ms. Allocated memory is still 226.5MB. Free memory was 186.1MB in the beginning and 184.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: 8]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L12] int SIZE; [L14] const int MAX = 100000; VAL [MAX=100000, SIZE=0] [L18] SIZE = __VERIFIER_nondet_int() [L19] COND TRUE SIZE > 1 && SIZE < MAX [L21] int i; [L22] int *a = malloc(sizeof(int)*SIZE); [L24] i = 0 VAL [MAX=100000, SIZE=2, a={-1:0}, i=0] [L24] COND TRUE i < SIZE [L26] a[i] = __VERIFIER_nondet_int() [L24] i++ VAL [MAX=100000, SIZE=2, a={-1:0}, i=1] [L24] COND TRUE i < SIZE [L26] a[i] = __VERIFIER_nondet_int() [L24] i++ VAL [MAX=100000, SIZE=2, a={-1:0}, i=2] [L24] COND FALSE !(i < SIZE) VAL [MAX=100000, SIZE=2, a={-1:0}] [L29] COND FALSE !(SIZE % 2 != 0) [L31] CALL assume_abort_if_not(SIZE % 2 == 0) [L6] COND FALSE !(!cond) VAL [MAX=100000, SIZE=2] [L31] RET assume_abort_if_not(SIZE % 2 == 0) [L32] i = 1 VAL [MAX=100000, SIZE=2, a={-1:0}, i=1] [L32] COND TRUE i <= SIZE/2 [L34] EXPR a[2*i-2] VAL [MAX=100000, SIZE=2] [L34] COND FALSE !(a[2*i-2] > i) [L38] EXPR a[2*i-1] VAL [MAX=100000, SIZE=2] [L38] COND TRUE a[2*i-1] > i [L40] a[2*i-1] = 2*i-1 VAL [MAX=100000, SIZE=2] [L32] i++ VAL [MAX=100000, SIZE=2, a={-1:0}, i=2] [L32] COND FALSE !(i <= SIZE/2) VAL [MAX=100000, SIZE=2, a={-1:0}] [L44] i = 0 VAL [MAX=100000, SIZE=2, a={-1:0}, i=0] [L44] COND TRUE i < SIZE [L46] EXPR a[i] [L46] CALL __VERIFIER_assert( a[i] <= i ) [L8] COND TRUE !(cond) VAL [MAX=100000, SIZE=2] [L8] reach_error() VAL [MAX=100000, SIZE=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.3s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 160 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 160 mSDsluCounter, 194 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 94 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 277 IncrementalHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 100 mSDtfsCounter, 277 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 98 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=5, InterpolantAutomatonStates: 26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 28 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 131 NumberOfCodeBlocks, 131 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 136 ConstructedInterpolants, 0 QuantifiedInterpolants, 548 SizeOfPredicates, 8 NumberOfNonLiveVariables, 176 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 9 InterpolantComputations, 3 PerfectInterpolantSequences, 16/22 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-08 09:56:48,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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