./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-properties/list_search-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-properties/list_search-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ef935aaf7590747bfbe771bbb249e6b84337edbf0e97024d9de82d0d23d44f30 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 13:55:51,170 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 13:55:51,239 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 13:55:51,245 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 13:55:51,245 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 13:55:51,273 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 13:55:51,275 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 13:55:51,275 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 13:55:51,276 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 13:55:51,276 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 13:55:51,277 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 13:55:51,277 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 13:55:51,278 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 13:55:51,278 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 13:55:51,278 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 13:55:51,279 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 13:55:51,280 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 13:55:51,282 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 13:55:51,283 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 13:55:51,283 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 13:55:51,283 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 13:55:51,285 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 13:55:51,286 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 13:55:51,286 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 13:55:51,286 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 13:55:51,286 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 13:55:51,287 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 13:55:51,287 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 13:55:51,287 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 13:55:51,288 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 13:55:51,288 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 13:55:51,288 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 13:55:51,288 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 13:55:51,289 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 13:55:51,289 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 13:55:51,289 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 13:55:51,290 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 13:55:51,290 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 13:55:51,291 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 13:55:51,291 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 13:55:51,292 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 13:55:51,292 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 13:55:51,292 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 -> ef935aaf7590747bfbe771bbb249e6b84337edbf0e97024d9de82d0d23d44f30 [2024-11-08 13:55:51,587 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 13:55:51,612 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 13:55:51,615 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 13:55:51,616 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 13:55:51,616 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 13:55:51,617 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-properties/list_search-1.i [2024-11-08 13:55:53,027 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 13:55:53,283 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 13:55:53,283 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list_search-1.i [2024-11-08 13:55:53,305 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f12168e9/44e8be7a6f8a4b39aad4930a68125d7b/FLAG046ea87fa [2024-11-08 13:55:53,322 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f12168e9/44e8be7a6f8a4b39aad4930a68125d7b [2024-11-08 13:55:53,325 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 13:55:53,327 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 13:55:53,329 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 13:55:53,330 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 13:55:53,335 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 13:55:53,336 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 01:55:53" (1/1) ... [2024-11-08 13:55:53,337 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66bd84e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:55:53, skipping insertion in model container [2024-11-08 13:55:53,337 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 01:55:53" (1/1) ... [2024-11-08 13:55:53,382 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 13:55:53,588 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list_search-1.i[813,826] [2024-11-08 13:55:53,735 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 13:55:53,744 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 13:55:53,757 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list_search-1.i[813,826] [2024-11-08 13:55:53,813 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 13:55:53,888 INFO L204 MainTranslator]: Completed translation [2024-11-08 13:55:53,889 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:55:53 WrapperNode [2024-11-08 13:55:53,889 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 13:55:53,891 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 13:55:53,891 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 13:55:53,892 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 13:55:53,899 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:55:53" (1/1) ... [2024-11-08 13:55:53,909 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:55:53" (1/1) ... [2024-11-08 13:55:53,926 INFO L138 Inliner]: procedures = 125, calls = 22, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 66 [2024-11-08 13:55:53,927 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 13:55:53,927 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 13:55:53,928 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 13:55:53,928 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 13:55:53,937 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:55:53" (1/1) ... [2024-11-08 13:55:53,938 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:55:53" (1/1) ... [2024-11-08 13:55:53,940 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:55:53" (1/1) ... [2024-11-08 13:55:53,955 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 4 writes are split as follows [0, 4]. [2024-11-08 13:55:53,955 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:55:53" (1/1) ... [2024-11-08 13:55:53,956 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:55:53" (1/1) ... [2024-11-08 13:55:53,961 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:55:53" (1/1) ... [2024-11-08 13:55:53,976 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:55:53" (1/1) ... [2024-11-08 13:55:53,978 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:55:53" (1/1) ... [2024-11-08 13:55:53,979 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:55:53" (1/1) ... [2024-11-08 13:55:53,981 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 13:55:53,982 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 13:55:53,982 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 13:55:53,982 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 13:55:53,983 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:55:53" (1/1) ... [2024-11-08 13:55:53,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 13:55:54,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:55:54,028 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 13:55:54,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 13:55:54,080 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-08 13:55:54,081 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-08 13:55:54,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-08 13:55:54,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-08 13:55:54,082 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-08 13:55:54,082 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 13:55:54,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-08 13:55:54,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-08 13:55:54,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-08 13:55:54,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-08 13:55:54,084 INFO L130 BoogieDeclarations]: Found specification of procedure insert_list [2024-11-08 13:55:54,084 INFO L138 BoogieDeclarations]: Found implementation of procedure insert_list [2024-11-08 13:55:54,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 13:55:54,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 13:55:54,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 13:55:54,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 13:55:54,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 13:55:54,228 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 13:55:54,231 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 13:55:54,406 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2024-11-08 13:55:54,406 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 13:55:54,425 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 13:55:54,425 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-08 13:55:54,425 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 01:55:54 BoogieIcfgContainer [2024-11-08 13:55:54,425 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 13:55:54,429 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 13:55:54,429 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 13:55:54,432 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 13:55:54,433 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 01:55:53" (1/3) ... [2024-11-08 13:55:54,434 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d833f97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 01:55:54, skipping insertion in model container [2024-11-08 13:55:54,434 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:55:53" (2/3) ... [2024-11-08 13:55:54,434 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d833f97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 01:55:54, skipping insertion in model container [2024-11-08 13:55:54,435 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 01:55:54" (3/3) ... [2024-11-08 13:55:54,436 INFO L112 eAbstractionObserver]: Analyzing ICFG list_search-1.i [2024-11-08 13:55:54,454 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 13:55:54,455 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 13:55:54,520 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 13:55:54,527 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;@7e5e550, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 13:55:54,528 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 13:55:54,534 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 21 states have (on average 1.380952380952381) internal successors, (29), 22 states have internal predecessors, (29), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-08 13:55:54,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-08 13:55:54,542 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:55:54,543 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:55:54,544 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:55:54,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:55:54,550 INFO L85 PathProgramCache]: Analyzing trace with hash -547062782, now seen corresponding path program 1 times [2024-11-08 13:55:54,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:55:54,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387484056] [2024-11-08 13:55:54,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:55:54,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:55:54,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:55:55,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:55:55,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:55:55,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 13:55:55,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:55:55,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 13:55:55,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:55:55,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 13:55:55,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:55:55,285 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-08 13:55:55,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:55:55,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387484056] [2024-11-08 13:55:55,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387484056] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:55:55,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1014243049] [2024-11-08 13:55:55,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:55:55,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:55:55,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:55:55,290 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 13:55:55,292 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 13:55:55,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:55:55,559 INFO L255 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 13:55:55,564 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:55:55,577 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-08 13:55:55,578 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 13:55:55,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1014243049] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:55:55,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 13:55:55,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 7 [2024-11-08 13:55:55,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594713618] [2024-11-08 13:55:55,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:55:55,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 13:55:55,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:55:55,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 13:55:55,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-08 13:55:55,615 INFO L87 Difference]: Start difference. First operand has 28 states, 21 states have (on average 1.380952380952381) internal successors, (29), 22 states have internal predecessors, (29), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-08 13:55:55,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:55:55,630 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2024-11-08 13:55:55,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 13:55:55,633 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 35 [2024-11-08 13:55:55,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:55:55,638 INFO L225 Difference]: With dead ends: 38 [2024-11-08 13:55:55,638 INFO L226 Difference]: Without dead ends: 23 [2024-11-08 13:55:55,641 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-08 13:55:55,644 INFO L432 NwaCegarLoop]: 34 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, 34 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 13:55:55,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:55:55,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-08 13:55:55,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-11-08 13:55:55,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-08 13:55:55,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2024-11-08 13:55:55,680 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 35 [2024-11-08 13:55:55,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:55:55,681 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2024-11-08 13:55:55,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-08 13:55:55,681 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2024-11-08 13:55:55,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-08 13:55:55,683 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:55:55,683 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:55:55,696 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 13:55:55,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-08 13:55:55,885 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:55:55,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:55:55,885 INFO L85 PathProgramCache]: Analyzing trace with hash -745059685, now seen corresponding path program 1 times [2024-11-08 13:55:55,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:55:55,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289366861] [2024-11-08 13:55:55,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:55:55,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:55:55,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:55:56,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:55:56,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:55:56,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 13:55:56,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:55:56,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 13:55:56,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:55:56,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 13:55:56,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:55:56,163 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-08 13:55:56,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:55:56,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289366861] [2024-11-08 13:55:56,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289366861] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:55:56,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1502178415] [2024-11-08 13:55:56,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:55:56,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:55:56,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:55:56,170 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 13:55:56,172 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 13:55:56,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:55:56,339 INFO L255 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-08 13:55:56,343 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:55:56,415 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 13:55:56,448 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 13:55:56,570 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 13:55:56,616 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-08 13:55:56,620 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 13:55:56,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1502178415] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:55:56,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 13:55:56,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2024-11-08 13:55:56,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129547732] [2024-11-08 13:55:56,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:55:56,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 13:55:56,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:55:56,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 13:55:56,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-11-08 13:55:56,624 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-08 13:55:56,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:55:56,884 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2024-11-08 13:55:56,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 13:55:56,885 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 37 [2024-11-08 13:55:56,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:55:56,888 INFO L225 Difference]: With dead ends: 50 [2024-11-08 13:55:56,888 INFO L226 Difference]: Without dead ends: 45 [2024-11-08 13:55:56,890 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2024-11-08 13:55:56,892 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 22 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 13:55:56,892 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 78 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 13:55:56,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-08 13:55:56,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 30. [2024-11-08 13:55:56,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-08 13:55:56,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2024-11-08 13:55:56,908 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 37 [2024-11-08 13:55:56,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:55:56,908 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2024-11-08 13:55:56,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-08 13:55:56,909 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2024-11-08 13:55:56,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-08 13:55:56,910 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:55:56,910 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:55:56,930 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 13:55:57,115 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,SelfDestructingSolverStorable1 [2024-11-08 13:55:57,115 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:55:57,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:55:57,116 INFO L85 PathProgramCache]: Analyzing trace with hash -687801383, now seen corresponding path program 1 times [2024-11-08 13:55:57,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:55:57,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070370939] [2024-11-08 13:55:57,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:55:57,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:55:57,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:55:57,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:55:57,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:55:57,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 13:55:57,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:55:57,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 13:55:57,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:55:57,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 13:55:57,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:55:57,354 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-08 13:55:57,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:55:57,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070370939] [2024-11-08 13:55:57,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070370939] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:55:57,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1762469655] [2024-11-08 13:55:57,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:55:57,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:55:57,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:55:57,358 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-08 13:55:57,359 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-08 13:55:57,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:55:57,518 INFO L255 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-08 13:55:57,520 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:55:57,548 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-08 13:55:57,549 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:55:57,637 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-08 13:55:57,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1762469655] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 13:55:57,637 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 13:55:57,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 8 [2024-11-08 13:55:57,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786695960] [2024-11-08 13:55:57,638 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 13:55:57,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 13:55:57,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:55:57,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 13:55:57,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-08 13:55:57,639 INFO L87 Difference]: Start difference. First operand 30 states and 39 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-08 13:55:57,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:55:57,757 INFO L93 Difference]: Finished difference Result 54 states and 68 transitions. [2024-11-08 13:55:57,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 13:55:57,758 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 37 [2024-11-08 13:55:57,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:55:57,759 INFO L225 Difference]: With dead ends: 54 [2024-11-08 13:55:57,759 INFO L226 Difference]: Without dead ends: 29 [2024-11-08 13:55:57,760 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-08 13:55:57,761 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 32 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 13:55:57,761 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 90 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 13:55:57,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-08 13:55:57,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2024-11-08 13:55:57,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-08 13:55:57,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2024-11-08 13:55:57,767 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 37 [2024-11-08 13:55:57,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:55:57,767 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2024-11-08 13:55:57,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-08 13:55:57,768 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2024-11-08 13:55:57,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-08 13:55:57,769 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:55:57,769 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:55:57,786 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-08 13:55:57,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:55:57,970 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:55:57,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:55:57,970 INFO L85 PathProgramCache]: Analyzing trace with hash -2113798375, now seen corresponding path program 1 times [2024-11-08 13:55:57,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:55:57,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667741499] [2024-11-08 13:55:57,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:55:57,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:55:58,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:55:58,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:55:58,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:55:58,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 13:55:58,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:55:58,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 13:55:58,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:55:58,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 13:55:58,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:55:58,491 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-08 13:55:58,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:55:58,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667741499] [2024-11-08 13:55:58,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667741499] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:55:58,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:55:58,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 13:55:58,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774390741] [2024-11-08 13:55:58,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:55:58,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 13:55:58,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:55:58,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 13:55:58,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-08 13:55:58,495 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-08 13:55:58,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:55:58,678 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2024-11-08 13:55:58,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 13:55:58,681 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 37 [2024-11-08 13:55:58,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:55:58,682 INFO L225 Difference]: With dead ends: 39 [2024-11-08 13:55:58,682 INFO L226 Difference]: Without dead ends: 34 [2024-11-08 13:55:58,682 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2024-11-08 13:55:58,683 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 27 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 13:55:58,683 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 80 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 13:55:58,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-08 13:55:58,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2024-11-08 13:55:58,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-08 13:55:58,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2024-11-08 13:55:58,693 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 37 [2024-11-08 13:55:58,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:55:58,694 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2024-11-08 13:55:58,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-08 13:55:58,694 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2024-11-08 13:55:58,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-08 13:55:58,695 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:55:58,695 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:55:58,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 13:55:58,695 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:55:58,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:55:58,696 INFO L85 PathProgramCache]: Analyzing trace with hash -2056540073, now seen corresponding path program 1 times [2024-11-08 13:55:58,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:55:58,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475969227] [2024-11-08 13:55:58,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:55:58,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:55:58,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:55:58,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:55:58,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:55:58,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 13:55:58,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:55:58,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 13:55:58,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:55:58,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 13:55:58,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:55:58,862 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-08 13:55:58,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:55:58,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475969227] [2024-11-08 13:55:58,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475969227] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:55:58,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:55:58,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 13:55:58,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735739580] [2024-11-08 13:55:58,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:55:58,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 13:55:58,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:55:58,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 13:55:58,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 13:55:58,865 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-08 13:55:58,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:55:58,978 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2024-11-08 13:55:58,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 13:55:58,978 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 37 [2024-11-08 13:55:58,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:55:58,980 INFO L225 Difference]: With dead ends: 40 [2024-11-08 13:55:58,981 INFO L226 Difference]: Without dead ends: 32 [2024-11-08 13:55:58,981 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-08 13:55:58,982 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 27 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 13:55:58,982 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 87 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 13:55:58,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-08 13:55:58,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2024-11-08 13:55:58,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-08 13:55:58,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2024-11-08 13:55:58,987 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 37 [2024-11-08 13:55:58,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:55:58,987 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2024-11-08 13:55:58,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-08 13:55:58,988 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2024-11-08 13:55:58,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-08 13:55:58,988 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:55:58,988 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:55:58,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 13:55:58,989 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:55:58,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:55:58,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1005030197, now seen corresponding path program 1 times [2024-11-08 13:55:58,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:55:58,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678719116] [2024-11-08 13:55:58,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:55:58,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:55:59,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:55:59,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:55:59,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:55:59,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 13:55:59,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:55:59,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 13:55:59,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:55:59,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 13:55:59,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:56:00,198 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-08 13:56:00,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:56:00,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678719116] [2024-11-08 13:56:00,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678719116] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:56:00,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [131203741] [2024-11-08 13:56:00,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:56:00,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:56:00,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:56:00,201 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 13:56:00,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 13:56:00,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:56:00,396 INFO L255 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 74 conjuncts are in the unsatisfiable core [2024-11-08 13:56:00,401 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:56:00,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-11-08 13:56:00,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-11-08 13:56:00,539 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 11 treesize of output 7 [2024-11-08 13:56:00,547 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 11 treesize of output 7 [2024-11-08 13:56:00,630 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-08 13:56:00,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-08 13:56:00,641 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 20 treesize of output 15 [2024-11-08 13:56:00,759 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 27 treesize of output 15 [2024-11-08 13:56:00,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2024-11-08 13:56:00,829 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-08 13:56:00,829 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:56:01,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [131203741] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:56:01,194 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 13:56:01,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 21 [2024-11-08 13:56:01,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346690714] [2024-11-08 13:56:01,195 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 13:56:01,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-08 13:56:01,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:56:01,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-08 13:56:01,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=680, Unknown=0, NotChecked=0, Total=756 [2024-11-08 13:56:01,196 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 21 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 17 states have internal predecessors, (44), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 13:56:01,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:56:01,904 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2024-11-08 13:56:01,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-08 13:56:01,905 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 17 states have internal predecessors, (44), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 40 [2024-11-08 13:56:01,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:56:01,906 INFO L225 Difference]: With dead ends: 48 [2024-11-08 13:56:01,906 INFO L226 Difference]: Without dead ends: 40 [2024-11-08 13:56:01,906 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=171, Invalid=1469, Unknown=0, NotChecked=0, Total=1640 [2024-11-08 13:56:01,907 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 49 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 13:56:01,908 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 191 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 13:56:01,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-08 13:56:01,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2024-11-08 13:56:01,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-08 13:56:01,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2024-11-08 13:56:01,918 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 40 [2024-11-08 13:56:01,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:56:01,918 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2024-11-08 13:56:01,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 17 states have internal predecessors, (44), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 13:56:01,919 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2024-11-08 13:56:01,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-08 13:56:01,922 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:56:01,922 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:56:01,941 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-08 13:56:02,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:56:02,129 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:56:02,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:56:02,129 INFO L85 PathProgramCache]: Analyzing trace with hash 2009254361, now seen corresponding path program 2 times [2024-11-08 13:56:02,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:56:02,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951419495] [2024-11-08 13:56:02,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:56:02,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:56:02,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:56:03,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:56:03,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:56:03,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 13:56:03,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:56:03,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 13:56:03,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:56:03,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 13:56:03,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:56:04,106 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 12 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 13:56:04,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:56:04,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951419495] [2024-11-08 13:56:04,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951419495] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:56:04,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1241139175] [2024-11-08 13:56:04,108 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 13:56:04,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:56:04,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:56:04,110 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 13:56:04,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 13:56:04,307 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 13:56:04,308 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 13:56:04,315 INFO L255 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 106 conjuncts are in the unsatisfiable core [2024-11-08 13:56:04,325 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:56:04,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-11-08 13:56:04,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 1 [2024-11-08 13:56:04,640 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 11 treesize of output 7 [2024-11-08 13:56:04,652 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 11 treesize of output 7 [2024-11-08 13:56:04,822 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-08 13:56:04,822 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 1 case distinctions, treesize of input 20 treesize of output 23 [2024-11-08 13:56:04,848 INFO L349 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2024-11-08 13:56:04,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2024-11-08 13:56:05,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 9 treesize of output 12 [2024-11-08 13:56:05,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 9 treesize of output 12 [2024-11-08 13:56:05,151 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-08 13:56:05,152 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 1 case distinctions, treesize of input 20 treesize of output 23 [2024-11-08 13:56:05,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:56:05,170 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 53 treesize of output 36 [2024-11-08 13:56:05,188 INFO L349 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2024-11-08 13:56:05,188 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 1 case distinctions, treesize of input 24 treesize of output 31 [2024-11-08 13:56:05,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:56:05,206 INFO L349 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2024-11-08 13:56:05,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 22 [2024-11-08 13:56:05,507 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 13:56:05,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 33 [2024-11-08 13:56:05,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-08 13:56:05,581 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 13:56:05,590 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 17 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 13:56:05,591 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:56:05,932 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:56:05,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 38 [2024-11-08 13:56:05,939 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:56:05,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 35 [2024-11-08 13:56:06,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1241139175] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:56:06,034 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 13:56:06,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 35 [2024-11-08 13:56:06,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663680501] [2024-11-08 13:56:06,035 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 13:56:06,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-08 13:56:06,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:56:06,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-08 13:56:06,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1538, Unknown=0, NotChecked=0, Total=1640 [2024-11-08 13:56:06,037 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand has 35 states, 35 states have (on average 1.6571428571428573) internal successors, (58), 30 states have internal predecessors, (58), 5 states have call successors, (8), 4 states have call predecessors, (8), 7 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-08 13:56:07,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:56:07,622 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2024-11-08 13:56:07,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-08 13:56:07,623 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.6571428571428573) internal successors, (58), 30 states have internal predecessors, (58), 5 states have call successors, (8), 4 states have call predecessors, (8), 7 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) Word has length 43 [2024-11-08 13:56:07,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:56:07,626 INFO L225 Difference]: With dead ends: 55 [2024-11-08 13:56:07,627 INFO L226 Difference]: Without dead ends: 50 [2024-11-08 13:56:07,628 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 545 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=334, Invalid=3326, Unknown=0, NotChecked=0, Total=3660 [2024-11-08 13:56:07,630 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 88 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 680 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 13:56:07,630 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 332 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 680 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 13:56:07,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-08 13:56:07,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2024-11-08 13:56:07,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 38 states have (on average 1.131578947368421) internal successors, (43), 38 states have internal predecessors, (43), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-08 13:56:07,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2024-11-08 13:56:07,640 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 43 [2024-11-08 13:56:07,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:56:07,640 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2024-11-08 13:56:07,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.6571428571428573) internal successors, (58), 30 states have internal predecessors, (58), 5 states have call successors, (8), 4 states have call predecessors, (8), 7 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-08 13:56:07,640 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2024-11-08 13:56:07,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-08 13:56:07,641 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:56:07,641 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:56:07,658 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-08 13:56:07,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:56:07,842 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:56:07,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:56:07,842 INFO L85 PathProgramCache]: Analyzing trace with hash 2066512663, now seen corresponding path program 1 times [2024-11-08 13:56:07,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:56:07,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387805800] [2024-11-08 13:56:07,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:56:07,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:56:07,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:56:08,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:56:08,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:56:08,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 13:56:08,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:56:08,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 13:56:08,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:56:08,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 13:56:08,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:56:08,794 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 22 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 13:56:08,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:56:08,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387805800] [2024-11-08 13:56:08,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387805800] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:56:08,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [442350719] [2024-11-08 13:56:08,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:56:08,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:56:08,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:56:08,800 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 13:56:08,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-08 13:56:09,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:56:09,013 INFO L255 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-08 13:56:09,017 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:56:09,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-11-08 13:56:09,062 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 13:56:09,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 11 treesize of output 14 [2024-11-08 13:56:09,161 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 13 treesize of output 9 [2024-11-08 13:56:09,234 INFO L349 Elim1Store]: treesize reduction 25, result has 45.7 percent of original size [2024-11-08 13:56:09,234 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 1 case distinctions, treesize of input 23 treesize of output 28 [2024-11-08 13:56:09,249 INFO L349 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2024-11-08 13:56:09,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2024-11-08 13:56:09,328 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 9 treesize of output 3 [2024-11-08 13:56:09,388 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-08 13:56:09,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 15 [2024-11-08 13:56:09,393 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 23 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 13:56:09,393 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:56:09,538 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:56:09,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 22 [2024-11-08 13:56:09,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [442350719] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:56:09,573 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 13:56:09,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 25 [2024-11-08 13:56:09,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013619144] [2024-11-08 13:56:09,574 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 13:56:09,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-08 13:56:09,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:56:09,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-08 13:56:09,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=732, Unknown=0, NotChecked=0, Total=812 [2024-11-08 13:56:09,575 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand has 25 states, 25 states have (on average 1.96) internal successors, (49), 20 states have internal predecessors, (49), 3 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-08 13:56:10,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:56:10,474 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2024-11-08 13:56:10,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-08 13:56:10,475 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.96) internal successors, (49), 20 states have internal predecessors, (49), 3 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 43 [2024-11-08 13:56:10,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:56:10,476 INFO L225 Difference]: With dead ends: 71 [2024-11-08 13:56:10,477 INFO L226 Difference]: Without dead ends: 59 [2024-11-08 13:56:10,478 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 423 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=321, Invalid=1935, Unknown=0, NotChecked=0, Total=2256 [2024-11-08 13:56:10,479 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 104 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 13:56:10,479 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 271 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 13:56:10,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-08 13:56:10,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 54. [2024-11-08 13:56:10,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 43 states have (on average 1.069767441860465) internal successors, (46), 43 states have internal predecessors, (46), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-08 13:56:10,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2024-11-08 13:56:10,494 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 43 [2024-11-08 13:56:10,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:56:10,496 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2024-11-08 13:56:10,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.96) internal successors, (49), 20 states have internal predecessors, (49), 3 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-08 13:56:10,496 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2024-11-08 13:56:10,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-08 13:56:10,500 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:56:10,501 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:56:10,520 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-08 13:56:10,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:56:10,702 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:56:10,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:56:10,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1384296971, now seen corresponding path program 3 times [2024-11-08 13:56:10,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:56:10,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774631112] [2024-11-08 13:56:10,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:56:10,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:56:10,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 13:56:10,745 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 13:56:10,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 13:56:10,803 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 13:56:10,803 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 13:56:10,804 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 13:56:10,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 13:56:10,808 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1] [2024-11-08 13:56:10,855 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 13:56:10,859 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 01:56:10 BoogieIcfgContainer [2024-11-08 13:56:10,859 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 13:56:10,860 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 13:56:10,860 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 13:56:10,860 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 13:56:10,862 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 01:55:54" (3/4) ... [2024-11-08 13:56:10,862 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-08 13:56:10,917 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 13:56:10,918 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 13:56:10,918 INFO L158 Benchmark]: Toolchain (without parser) took 17591.56ms. Allocated memory was 176.2MB in the beginning and 318.8MB in the end (delta: 142.6MB). Free memory was 96.8MB in the beginning and 100.7MB in the end (delta: -3.9MB). Peak memory consumption was 140.3MB. Max. memory is 16.1GB. [2024-11-08 13:56:10,918 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 176.2MB. Free memory is still 143.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 13:56:10,919 INFO L158 Benchmark]: CACSL2BoogieTranslator took 559.62ms. Allocated memory is still 176.2MB. Free memory was 96.5MB in the beginning and 142.1MB in the end (delta: -45.6MB). Peak memory consumption was 22.3MB. Max. memory is 16.1GB. [2024-11-08 13:56:10,919 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.80ms. Allocated memory is still 176.2MB. Free memory was 142.1MB in the beginning and 140.0MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 13:56:10,919 INFO L158 Benchmark]: Boogie Preprocessor took 53.67ms. Allocated memory is still 176.2MB. Free memory was 140.0MB in the beginning and 137.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 13:56:10,919 INFO L158 Benchmark]: RCFGBuilder took 443.62ms. Allocated memory is still 176.2MB. Free memory was 137.1MB in the beginning and 122.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 13:56:10,920 INFO L158 Benchmark]: TraceAbstraction took 16430.05ms. Allocated memory was 176.2MB in the beginning and 318.8MB in the end (delta: 142.6MB). Free memory was 121.6MB in the beginning and 103.8MB in the end (delta: 17.8MB). Peak memory consumption was 162.0MB. Max. memory is 16.1GB. [2024-11-08 13:56:10,920 INFO L158 Benchmark]: Witness Printer took 57.97ms. Allocated memory is still 318.8MB. Free memory was 103.8MB in the beginning and 100.7MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 13:56:10,921 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.22ms. Allocated memory is still 176.2MB. Free memory is still 143.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 559.62ms. Allocated memory is still 176.2MB. Free memory was 96.5MB in the beginning and 142.1MB in the end (delta: -45.6MB). Peak memory consumption was 22.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.80ms. Allocated memory is still 176.2MB. Free memory was 142.1MB in the beginning and 140.0MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 53.67ms. Allocated memory is still 176.2MB. Free memory was 140.0MB in the beginning and 137.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 443.62ms. Allocated memory is still 176.2MB. Free memory was 137.1MB in the beginning and 122.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 16430.05ms. Allocated memory was 176.2MB in the beginning and 318.8MB in the end (delta: 142.6MB). Free memory was 121.6MB in the beginning and 103.8MB in the end (delta: 17.8MB). Peak memory consumption was 162.0MB. Max. memory is 16.1GB. * Witness Printer took 57.97ms. Allocated memory is still 318.8MB. Free memory was 103.8MB in the beginning and 100.7MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. 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: 15]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L533] mlist *head; VAL [head={0:0}] [L554] int i; [L555] mlist *mylist, *temp; VAL [head={0:0}] [L556] CALL insert_list(mylist,2) VAL [\old(k)=2, head={0:0}] [L542] l = (mlist*)malloc(sizeof(mlist)) [L543] l->key = k VAL [\old(k)=2, head={0:0}, k=2, l={-1:0}] [L544] COND TRUE head==((void *)0) [L545] l->next = ((void *)0) VAL [\old(k)=2, head={0:0}, k=2, l={-1:0}] [L550] head = l [L551] return 0; VAL [\old(k)=2, \result=0, head={-1:0}, k=2] [L556] RET insert_list(mylist,2) VAL [head={-1:0}, mylist={58:63}] [L557] CALL insert_list(mylist,5) VAL [\old(k)=5, head={-1:0}] [L542] l = (mlist*)malloc(sizeof(mlist)) [L543] l->key = k VAL [\old(k)=5, head={-1:0}, k=5, l={-5:0}] [L544] COND FALSE !(head==((void *)0)) [L547] l->key = k [L548] l->next = head VAL [\old(k)=5, head={-1:0}, l={-5:0}] [L550] head = l [L551] return 0; VAL [\old(k)=5, \result=0, head={-5:0}] [L557] RET insert_list(mylist,5) VAL [head={-5:0}, mylist={58:63}] [L558] CALL insert_list(mylist,1) VAL [\old(k)=1, head={-5:0}] [L542] l = (mlist*)malloc(sizeof(mlist)) [L543] l->key = k VAL [\old(k)=1, head={-5:0}, k=1, l={-3:0}] [L544] COND FALSE !(head==((void *)0)) [L547] l->key = k [L548] l->next = head VAL [\old(k)=1, head={-5:0}, l={-3:0}] [L550] head = l [L551] return 0; VAL [\old(k)=1, \result=0, head={-3:0}] [L558] RET insert_list(mylist,1) VAL [head={-3:0}, mylist={58:63}] [L559] CALL insert_list(mylist,3) VAL [\old(k)=3, head={-3:0}] [L542] l = (mlist*)malloc(sizeof(mlist)) [L543] l->key = k VAL [\old(k)=3, head={-3:0}, k=3, l={-4:0}] [L544] COND FALSE !(head==((void *)0)) [L547] l->key = k [L548] l->next = head VAL [\old(k)=3, head={-3:0}, l={-4:0}] [L550] head = l [L551] return 0; VAL [\old(k)=3, \result=0, head={-4:0}] [L559] RET insert_list(mylist,3) VAL [head={-4:0}, mylist={58:63}] [L560] CALL, EXPR search_list(head,2) [L535] l = head VAL [head={-4:0}, k=2, l={-4:0}] [L536] l!=((void *)0) && l->key!=k VAL [head={-4:0}, k=2, l={-4:0}] [L536] l!=((void *)0) && l->key!=k [L536] EXPR l->key [L536] l!=((void *)0) && l->key!=k VAL [head={-4:0}, k=2, l={-4:0}] [L536] COND TRUE l!=((void *)0) && l->key!=k [L537] EXPR l->next [L537] l = l->next [L536] l!=((void *)0) && l->key!=k VAL [head={-4:0}, k=2, l={-3:0}] [L536] l!=((void *)0) && l->key!=k [L536] EXPR l->key [L536] l!=((void *)0) && l->key!=k VAL [head={-4:0}, k=2, l={-3:0}] [L536] COND TRUE l!=((void *)0) && l->key!=k [L537] EXPR l->next [L537] l = l->next [L536] l!=((void *)0) && l->key!=k VAL [head={-4:0}, k=2, l={-5:0}] [L536] l!=((void *)0) && l->key!=k [L536] EXPR l->key [L536] l!=((void *)0) && l->key!=k VAL [head={-4:0}, k=2, l={-5:0}] [L536] COND TRUE l!=((void *)0) && l->key!=k [L537] EXPR l->next [L537] l = l->next [L536] l!=((void *)0) && l->key!=k VAL [head={-4:0}, k=2, l={-1:0}] [L536] l!=((void *)0) && l->key!=k [L536] EXPR l->key [L536] l!=((void *)0) && l->key!=k VAL [head={-4:0}, k=2, l={-1:0}] [L536] COND FALSE !(l!=((void *)0) && l->key!=k) [L539] return l; VAL [\result={-1:0}, head={-4:0}, k=2] [L560] RET, EXPR search_list(head,2) [L560] temp = search_list(head,2) [L561] EXPR temp->key [L561] CALL __VERIFIER_assert(temp->key==1) [L14] COND TRUE !(cond) VAL [head={-4:0}] [L15] reach_error() VAL [head={-4:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.3s, OverallIterations: 9, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 349 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 349 mSDsluCounter, 1163 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1005 mSDsCounter, 93 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1809 IncrementalHoareTripleChecker+Invalid, 1902 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 93 mSolverCounterUnsat, 158 mSDtfsCounter, 1809 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 522 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1222 ImplicationChecksByTransitivity, 4.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=8, InterpolantAutomatonStates: 105, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 29 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 9.1s InterpolantComputationTime, 590 NumberOfCodeBlocks, 590 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 566 ConstructedInterpolants, 6 QuantifiedInterpolants, 5017 SizeOfPredicates, 34 NumberOfNonLiveVariables, 2292 ConjunctsInSsa, 269 ConjunctsInUnsatCore, 15 InterpolantComputations, 4 PerfectInterpolantSequences, 342/492 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-08 13:56:10,945 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