./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list_search-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/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-wip.fs.cvc5-61a6796-m [2024-10-14 01:50:53,499 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 01:50:53,576 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 01:50:53,583 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 01:50:53,585 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 01:50:53,612 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 01:50:53,615 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 01:50:53,615 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 01:50:53,616 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 01:50:53,617 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 01:50:53,617 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 01:50:53,618 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 01:50:53,618 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 01:50:53,618 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 01:50:53,620 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 01:50:53,621 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 01:50:53,621 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 01:50:53,621 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 01:50:53,621 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 01:50:53,622 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 01:50:53,622 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 01:50:53,626 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 01:50:53,626 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 01:50:53,627 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 01:50:53,627 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 01:50:53,627 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 01:50:53,627 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 01:50:53,628 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 01:50:53,628 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 01:50:53,628 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 01:50:53,629 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 01:50:53,629 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 01:50:53,629 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 01:50:53,630 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 01:50:53,630 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 01:50:53,630 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 01:50:53,631 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 01:50:53,631 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 01:50:53,631 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 01:50:53,631 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 01:50:53,632 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 01:50:53,632 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 01:50:53,632 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-10-14 01:50:53,878 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 01:50:53,902 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 01:50:53,905 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 01:50:53,906 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 01:50:53,906 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 01:50:53,908 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list_search-1.i [2024-10-14 01:50:55,352 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 01:50:55,602 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 01:50:55,602 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list_search-1.i [2024-10-14 01:50:55,620 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcbf0b43a/0fe787ef1c974d18854d22b8c2da5f9b/FLAG24387ed5e [2024-10-14 01:50:55,927 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcbf0b43a/0fe787ef1c974d18854d22b8c2da5f9b [2024-10-14 01:50:55,930 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 01:50:55,931 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 01:50:55,934 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 01:50:55,935 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 01:50:55,940 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 01:50:55,941 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:50:55" (1/1) ... [2024-10-14 01:50:55,943 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13856d54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:50:55, skipping insertion in model container [2024-10-14 01:50:55,944 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:50:55" (1/1) ... [2024-10-14 01:50:55,995 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 01:50:56,146 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list_search-1.i[813,826] [2024-10-14 01:50:56,282 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 01:50:56,295 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 01:50:56,311 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list_search-1.i[813,826] [2024-10-14 01:50:56,360 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 01:50:56,402 INFO L204 MainTranslator]: Completed translation [2024-10-14 01:50:56,402 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:50:56 WrapperNode [2024-10-14 01:50:56,403 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 01:50:56,406 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 01:50:56,406 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 01:50:56,406 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 01:50:56,412 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:50:56" (1/1) ... [2024-10-14 01:50:56,424 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:50:56" (1/1) ... [2024-10-14 01:50:56,443 INFO L138 Inliner]: procedures = 125, calls = 22, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 66 [2024-10-14 01:50:56,443 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 01:50:56,444 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 01:50:56,444 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 01:50:56,444 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 01:50:56,454 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:50:56" (1/1) ... [2024-10-14 01:50:56,454 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:50:56" (1/1) ... [2024-10-14 01:50:56,457 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:50:56" (1/1) ... [2024-10-14 01:50:56,470 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-10-14 01:50:56,470 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:50:56" (1/1) ... [2024-10-14 01:50:56,471 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:50:56" (1/1) ... [2024-10-14 01:50:56,476 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:50:56" (1/1) ... [2024-10-14 01:50:56,479 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:50:56" (1/1) ... [2024-10-14 01:50:56,480 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:50:56" (1/1) ... [2024-10-14 01:50:56,481 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:50:56" (1/1) ... [2024-10-14 01:50:56,484 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 01:50:56,485 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 01:50:56,485 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 01:50:56,485 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 01:50:56,486 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:50:56" (1/1) ... [2024-10-14 01:50:56,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 01:50:56,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:50:56,519 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 01:50:56,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 01:50:56,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-14 01:50:56,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-14 01:50:56,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-14 01:50:56,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-14 01:50:56,562 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-14 01:50:56,562 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 01:50:56,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-14 01:50:56,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-14 01:50:56,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-14 01:50:56,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-14 01:50:56,562 INFO L130 BoogieDeclarations]: Found specification of procedure insert_list [2024-10-14 01:50:56,562 INFO L138 BoogieDeclarations]: Found implementation of procedure insert_list [2024-10-14 01:50:56,563 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 01:50:56,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 01:50:56,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 01:50:56,563 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 01:50:56,563 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 01:50:56,668 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 01:50:56,671 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 01:50:56,817 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2024-10-14 01:50:56,817 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 01:50:56,842 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 01:50:56,842 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-14 01:50:56,842 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:50:56 BoogieIcfgContainer [2024-10-14 01:50:56,843 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 01:50:56,845 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 01:50:56,845 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 01:50:56,850 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 01:50:56,850 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 01:50:55" (1/3) ... [2024-10-14 01:50:56,851 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c36b165 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:50:56, skipping insertion in model container [2024-10-14 01:50:56,852 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:50:56" (2/3) ... [2024-10-14 01:50:56,852 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c36b165 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:50:56, skipping insertion in model container [2024-10-14 01:50:56,852 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:50:56" (3/3) ... [2024-10-14 01:50:56,857 INFO L112 eAbstractionObserver]: Analyzing ICFG list_search-1.i [2024-10-14 01:50:56,875 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 01:50:56,875 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 01:50:56,946 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 01:50:56,954 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;@4b9a876e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 01:50:56,955 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 01:50:56,959 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 18 states have internal predecessors, (25), 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-10-14 01:50:56,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-14 01:50:56,967 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:50:56,967 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:50:56,968 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:50:56,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:50:56,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1970383394, now seen corresponding path program 1 times [2024-10-14 01:50:56,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:50:56,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119557534] [2024-10-14 01:50:56,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:50:56,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:50:57,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:50:57,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 01:50:57,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:50:57,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 01:50:57,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:50:57,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 01:50:57,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:50:57,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 01:50:57,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:50:57,690 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-14 01:50:57,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:50:57,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119557534] [2024-10-14 01:50:57,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119557534] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:50:57,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1578591278] [2024-10-14 01:50:57,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:50:57,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:50:57,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:50:57,698 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-10-14 01:50:57,699 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-10-14 01:50:57,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:50:57,883 INFO L255 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 01:50:57,889 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:50:57,907 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-14 01:50:57,907 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 01:50:57,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1578591278] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 01:50:57,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 01:50:57,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 7 [2024-10-14 01:50:57,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469116167] [2024-10-14 01:50:57,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 01:50:57,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 01:50:57,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:50:57,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 01:50:57,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 01:50:57,967 INFO L87 Difference]: Start difference. First operand has 24 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 18 states have internal predecessors, (25), 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 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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-10-14 01:50:58,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:50:58,016 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2024-10-14 01:50:58,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 01:50:58,019 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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 29 [2024-10-14 01:50:58,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:50:58,026 INFO L225 Difference]: With dead ends: 32 [2024-10-14 01:50:58,026 INFO L226 Difference]: Without dead ends: 20 [2024-10-14 01:50:58,029 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 36 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-10-14 01:50:58,033 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 01:50:58,036 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 01:50:58,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-10-14 01:50:58,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-10-14 01:50:58,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 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-10-14 01:50:58,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2024-10-14 01:50:58,072 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 29 [2024-10-14 01:50:58,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:50:58,074 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2024-10-14 01:50:58,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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-10-14 01:50:58,075 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2024-10-14 01:50:58,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-14 01:50:58,078 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:50:58,078 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:50:58,096 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 01:50:58,282 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-10-14 01:50:58,283 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:50:58,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:50:58,284 INFO L85 PathProgramCache]: Analyzing trace with hash -961709975, now seen corresponding path program 1 times [2024-10-14 01:50:58,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:50:58,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497975261] [2024-10-14 01:50:58,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:50:58,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:50:58,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:50:58,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 01:50:58,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:50:58,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 01:50:58,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:50:58,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 01:50:58,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:50:58,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 01:50:58,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:50:58,559 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-14 01:50:58,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:50:58,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497975261] [2024-10-14 01:50:58,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497975261] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:50:58,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622987644] [2024-10-14 01:50:58,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:50:58,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:50:58,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:50:58,564 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-10-14 01:50:58,566 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-10-14 01:50:58,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:50:58,724 INFO L255 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-14 01:50:58,730 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:50:58,800 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-10-14 01:50:58,825 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-10-14 01:50:58,949 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-10-14 01:50:58,979 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-14 01:50:58,980 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 01:50:58,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [622987644] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 01:50:58,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 01:50:58,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2024-10-14 01:50:58,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360797434] [2024-10-14 01:50:58,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 01:50:58,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 01:50:58,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:50:58,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 01:50:58,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-10-14 01:50:58,983 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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-10-14 01:50:59,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:50:59,258 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2024-10-14 01:50:59,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 01:50:59,259 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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 31 [2024-10-14 01:50:59,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:50:59,262 INFO L225 Difference]: With dead ends: 44 [2024-10-14 01:50:59,262 INFO L226 Difference]: Without dead ends: 40 [2024-10-14 01:50:59,263 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 33 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-10-14 01:50:59,265 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 21 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 01:50:59,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 61 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 01:50:59,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-10-14 01:50:59,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 26. [2024-10-14 01:50:59,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 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-10-14 01:50:59,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2024-10-14 01:50:59,274 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 35 transitions. Word has length 31 [2024-10-14 01:50:59,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:50:59,275 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 35 transitions. [2024-10-14 01:50:59,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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-10-14 01:50:59,275 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2024-10-14 01:50:59,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-14 01:50:59,276 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:50:59,277 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:50:59,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-14 01:50:59,478 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-10-14 01:50:59,479 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:50:59,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:50:59,479 INFO L85 PathProgramCache]: Analyzing trace with hash -959862933, now seen corresponding path program 1 times [2024-10-14 01:50:59,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:50:59,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672235249] [2024-10-14 01:50:59,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:50:59,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:50:59,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:50:59,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 01:50:59,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:50:59,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 01:50:59,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:50:59,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 01:50:59,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:50:59,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 01:50:59,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:50:59,664 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-14 01:50:59,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:50:59,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672235249] [2024-10-14 01:50:59,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672235249] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:50:59,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [424250240] [2024-10-14 01:50:59,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:50:59,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:50:59,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:50:59,667 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-10-14 01:50:59,669 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-10-14 01:50:59,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:50:59,819 INFO L255 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-14 01:50:59,822 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:50:59,840 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 20 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 01:50:59,841 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 01:50:59,939 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-14 01:50:59,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [424250240] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 01:50:59,939 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 01:50:59,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 9 [2024-10-14 01:50:59,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035802361] [2024-10-14 01:50:59,940 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 01:50:59,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 01:50:59,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:50:59,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 01:50:59,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-10-14 01:50:59,942 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 3 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-14 01:51:00,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:51:00,087 INFO L93 Difference]: Finished difference Result 47 states and 61 transitions. [2024-10-14 01:51:00,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 01:51:00,088 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 3 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 31 [2024-10-14 01:51:00,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:51:00,089 INFO L225 Difference]: With dead ends: 47 [2024-10-14 01:51:00,089 INFO L226 Difference]: Without dead ends: 25 [2024-10-14 01:51:00,089 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2024-10-14 01:51:00,090 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 31 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 01:51:00,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 82 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 01:51:00,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-10-14 01:51:00,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2024-10-14 01:51:00,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 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-10-14 01:51:00,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2024-10-14 01:51:00,102 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 31 [2024-10-14 01:51:00,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:51:00,102 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2024-10-14 01:51:00,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 3 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-14 01:51:00,102 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2024-10-14 01:51:00,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-14 01:51:00,103 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:51:00,103 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:51:00,117 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-14 01:51:00,307 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-10-14 01:51:00,308 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:51:00,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:51:00,308 INFO L85 PathProgramCache]: Analyzing trace with hash 2138016675, now seen corresponding path program 1 times [2024-10-14 01:51:00,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:51:00,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4476724] [2024-10-14 01:51:00,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:51:00,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:51:00,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:51:00,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 01:51:00,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:51:00,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 01:51:00,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:51:00,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 01:51:00,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:51:00,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 01:51:00,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:51:00,743 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-14 01:51:00,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:51:00,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4476724] [2024-10-14 01:51:00,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4476724] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 01:51:00,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 01:51:00,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 01:51:00,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273072880] [2024-10-14 01:51:00,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 01:51:00,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 01:51:00,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:51:00,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 01:51:00,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-14 01:51:00,747 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 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-10-14 01:51:00,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:51:00,890 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2024-10-14 01:51:00,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 01:51:00,891 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 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 31 [2024-10-14 01:51:00,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:51:00,892 INFO L225 Difference]: With dead ends: 34 [2024-10-14 01:51:00,892 INFO L226 Difference]: Without dead ends: 30 [2024-10-14 01:51:00,893 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 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-10-14 01:51:00,893 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 25 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 01:51:00,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 60 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 01:51:00,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-10-14 01:51:00,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2024-10-14 01:51:00,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 20 states have (on average 1.2) internal successors, (24), 20 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-10-14 01:51:00,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2024-10-14 01:51:00,900 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 31 [2024-10-14 01:51:00,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:51:00,900 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2024-10-14 01:51:00,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 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-10-14 01:51:00,901 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2024-10-14 01:51:00,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-14 01:51:00,901 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:51:00,902 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:51:00,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 01:51:00,902 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:51:00,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:51:00,902 INFO L85 PathProgramCache]: Analyzing trace with hash 2139863717, now seen corresponding path program 1 times [2024-10-14 01:51:00,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:51:00,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391740160] [2024-10-14 01:51:00,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:51:00,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:51:00,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:51:01,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 01:51:01,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:51:01,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 01:51:01,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:51:01,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 01:51:01,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:51:01,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 01:51:01,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:51:01,134 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-14 01:51:01,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:51:01,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391740160] [2024-10-14 01:51:01,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391740160] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 01:51:01,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 01:51:01,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 01:51:01,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781800697] [2024-10-14 01:51:01,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 01:51:01,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 01:51:01,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:51:01,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 01:51:01,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 01:51:01,138 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 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-10-14 01:51:01,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:51:01,246 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2024-10-14 01:51:01,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 01:51:01,247 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 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 31 [2024-10-14 01:51:01,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:51:01,248 INFO L225 Difference]: With dead ends: 35 [2024-10-14 01:51:01,248 INFO L226 Difference]: Without dead ends: 28 [2024-10-14 01:51:01,248 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-10-14 01:51:01,249 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 26 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 01:51:01,249 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 66 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 01:51:01,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-14 01:51:01,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2024-10-14 01:51:01,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 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-10-14 01:51:01,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2024-10-14 01:51:01,259 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 31 [2024-10-14 01:51:01,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:51:01,259 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2024-10-14 01:51:01,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 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-10-14 01:51:01,260 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2024-10-14 01:51:01,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-14 01:51:01,261 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:51:01,261 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:51:01,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 01:51:01,261 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:51:01,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:51:01,261 INFO L85 PathProgramCache]: Analyzing trace with hash -497212319, now seen corresponding path program 1 times [2024-10-14 01:51:01,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:51:01,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409014616] [2024-10-14 01:51:01,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:51:01,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:51:01,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:51:02,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 01:51:02,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:51:02,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 01:51:02,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:51:02,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 01:51:02,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:51:02,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 01:51:02,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:51:02,524 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-14 01:51:02,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:51:02,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409014616] [2024-10-14 01:51:02,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409014616] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:51:02,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987752350] [2024-10-14 01:51:02,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:51:02,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:51:02,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:51:02,527 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-10-14 01:51:02,529 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-10-14 01:51:02,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:51:02,709 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-10-14 01:51:02,713 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:51:02,723 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-10-14 01:51:02,735 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-10-14 01:51:02,837 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-10-14 01:51:02,852 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-10-14 01:51:02,922 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-10-14 01:51:02,923 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-10-14 01:51:02,933 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-10-14 01:51:03,057 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-10-14 01:51:03,064 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-10-14 01:51:03,144 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-14 01:51:03,144 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 01:51:03,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1987752350] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:51:03,388 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 01:51:03,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 20 [2024-10-14 01:51:03,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693726792] [2024-10-14 01:51:03,388 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 01:51:03,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-14 01:51:03,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:51:03,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-14 01:51:03,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=495, Unknown=2, NotChecked=0, Total=552 [2024-10-14 01:51:03,390 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 20 states, 17 states have (on average 2.176470588235294) internal successors, (37), 16 states have internal predecessors, (37), 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-10-14 01:51:04,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:51:04,052 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2024-10-14 01:51:04,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-14 01:51:04,053 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 2.176470588235294) internal successors, (37), 16 states have internal predecessors, (37), 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 34 [2024-10-14 01:51:04,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:51:04,054 INFO L225 Difference]: With dead ends: 41 [2024-10-14 01:51:04,055 INFO L226 Difference]: Without dead ends: 35 [2024-10-14 01:51:04,056 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=140, Invalid=1118, Unknown=2, NotChecked=0, Total=1260 [2024-10-14 01:51:04,059 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 44 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 01:51:04,059 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 131 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 01:51:04,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-10-14 01:51:04,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2024-10-14 01:51:04,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 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-10-14 01:51:04,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2024-10-14 01:51:04,072 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 34 [2024-10-14 01:51:04,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:51:04,072 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2024-10-14 01:51:04,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 2.176470588235294) internal successors, (37), 16 states have internal predecessors, (37), 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-10-14 01:51:04,072 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2024-10-14 01:51:04,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-14 01:51:04,073 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:51:04,073 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:51:04,092 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-14 01:51:04,274 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-10-14 01:51:04,274 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:51:04,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:51:04,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1103031011, now seen corresponding path program 2 times [2024-10-14 01:51:04,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:51:04,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129465664] [2024-10-14 01:51:04,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:51:04,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:51:04,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:51:05,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 01:51:05,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:51:05,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 01:51:05,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:51:05,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 01:51:05,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:51:05,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 01:51:05,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:51:06,251 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 9 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-14 01:51:06,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:51:06,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129465664] [2024-10-14 01:51:06,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129465664] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:51:06,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1751258750] [2024-10-14 01:51:06,252 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 01:51:06,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:51:06,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:51:06,254 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-10-14 01:51:06,256 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-10-14 01:51:06,438 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 01:51:06,439 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 01:51:06,443 INFO L255 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 112 conjuncts are in the unsatisfiable core [2024-10-14 01:51:06,454 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:51:06,462 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-10-14 01:51:06,507 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-10-14 01:51:06,733 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-10-14 01:51:06,744 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-10-14 01:51:06,872 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-10-14 01:51:06,872 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-10-14 01:51:06,895 INFO L349 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2024-10-14 01:51:06,896 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-10-14 01:51:07,140 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-10-14 01:51:07,152 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-10-14 01:51:07,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 16 treesize of output 21 [2024-10-14 01:51:07,355 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-10-14 01:51:07,355 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-10-14 01:51:07,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:51:07,372 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-10-14 01:51:07,387 INFO L349 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2024-10-14 01:51:07,388 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-10-14 01:51:07,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:51:07,405 INFO L349 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2024-10-14 01:51:07,405 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-10-14 01:51:07,805 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 01:51:07,805 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 54 treesize of output 29 [2024-10-14 01:51:07,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 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-10-14 01:51:07,902 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 01:51:07,903 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 01:51:08,353 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:51:08,354 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 41 treesize of output 45 [2024-10-14 01:51:08,364 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:51:08,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 45 [2024-10-14 01:51:08,374 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:51:08,374 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 32 treesize of output 36 [2024-10-14 01:51:08,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1751258750] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:51:08,477 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 01:51:08,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 38 [2024-10-14 01:51:08,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587605483] [2024-10-14 01:51:08,477 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 01:51:08,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-10-14 01:51:08,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:51:08,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-10-14 01:51:08,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1765, Unknown=1, NotChecked=0, Total=1892 [2024-10-14 01:51:08,480 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand has 38 states, 32 states have (on average 1.5625) internal successors, (50), 33 states have internal predecessors, (50), 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-10-14 01:51:10,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:51:10,181 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2024-10-14 01:51:10,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-14 01:51:10,181 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 32 states have (on average 1.5625) internal successors, (50), 33 states have internal predecessors, (50), 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 37 [2024-10-14 01:51:10,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:51:10,182 INFO L225 Difference]: With dead ends: 48 [2024-10-14 01:51:10,182 INFO L226 Difference]: Without dead ends: 44 [2024-10-14 01:51:10,184 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 671 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=383, Invalid=3648, Unknown=1, NotChecked=0, Total=4032 [2024-10-14 01:51:10,185 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 85 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 01:51:10,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 217 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 01:51:10,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-14 01:51:10,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2024-10-14 01:51:10,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 32 states have (on average 1.15625) internal successors, (37), 32 states have internal predecessors, (37), 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-10-14 01:51:10,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2024-10-14 01:51:10,205 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 37 [2024-10-14 01:51:10,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:51:10,207 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2024-10-14 01:51:10,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 32 states have (on average 1.5625) internal successors, (50), 33 states have internal predecessors, (50), 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-10-14 01:51:10,208 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2024-10-14 01:51:10,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-14 01:51:10,209 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:51:10,209 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-14 01:51:10,228 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-14 01:51:10,413 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-10-14 01:51:10,414 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:51:10,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:51:10,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1104878053, now seen corresponding path program 1 times [2024-10-14 01:51:10,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:51:10,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003237885] [2024-10-14 01:51:10,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:51:10,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:51:10,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:51:11,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 01:51:11,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:51:11,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 01:51:11,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:51:11,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 01:51:11,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:51:11,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 01:51:11,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:51:11,501 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 17 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-14 01:51:11,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:51:11,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003237885] [2024-10-14 01:51:11,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003237885] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:51:11,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [66830508] [2024-10-14 01:51:11,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:51:11,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:51:11,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:51:11,504 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-10-14 01:51:11,506 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-10-14 01:51:11,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:51:11,697 INFO L255 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-10-14 01:51:11,700 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:51:11,729 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-10-14 01:51:11,740 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-10-14 01:51:11,830 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-10-14 01:51:11,838 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-10-14 01:51:11,927 INFO L349 Elim1Store]: treesize reduction 25, result has 45.7 percent of original size [2024-10-14 01:51:11,927 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-10-14 01:51:11,946 INFO L349 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2024-10-14 01:51:11,946 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-10-14 01:51:12,023 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-10-14 01:51:12,092 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-10-14 01:51:12,093 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-10-14 01:51:12,096 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 01:51:12,096 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 01:51:12,246 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:51:12,246 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-10-14 01:51:12,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [66830508] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:51:12,284 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 01:51:12,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 25 [2024-10-14 01:51:12,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309942369] [2024-10-14 01:51:12,285 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 01:51:12,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-14 01:51:12,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:51:12,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-14 01:51:12,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=732, Unknown=0, NotChecked=0, Total=812 [2024-10-14 01:51:12,286 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 25 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 20 states have internal predecessors, (42), 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-10-14 01:51:13,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:51:13,141 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2024-10-14 01:51:13,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-14 01:51:13,141 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 20 states have internal predecessors, (42), 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 37 [2024-10-14 01:51:13,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:51:13,142 INFO L225 Difference]: With dead ends: 63 [2024-10-14 01:51:13,142 INFO L226 Difference]: Without dead ends: 52 [2024-10-14 01:51:13,143 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 47 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-10-14 01:51:13,144 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 98 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 01:51:13,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 137 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 01:51:13,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-14 01:51:13,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 47. [2024-10-14 01:51:13,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 36 states have internal predecessors, (39), 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-10-14 01:51:13,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2024-10-14 01:51:13,153 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 37 [2024-10-14 01:51:13,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:51:13,153 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2024-10-14 01:51:13,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 20 states have internal predecessors, (42), 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-10-14 01:51:13,154 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2024-10-14 01:51:13,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-14 01:51:13,154 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:51:13,155 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:51:13,168 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-14 01:51:13,355 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-10-14 01:51:13,356 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:51:13,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:51:13,356 INFO L85 PathProgramCache]: Analyzing trace with hash -184910559, now seen corresponding path program 3 times [2024-10-14 01:51:13,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:51:13,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357109115] [2024-10-14 01:51:13,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:51:13,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:51:13,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 01:51:13,390 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 01:51:13,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 01:51:13,434 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 01:51:13,435 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 01:51:13,436 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 01:51:13,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 01:51:13,442 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1] [2024-10-14 01:51:13,488 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 01:51:13,492 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 01:51:13 BoogieIcfgContainer [2024-10-14 01:51:13,493 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 01:51:13,493 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 01:51:13,493 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 01:51:13,494 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 01:51:13,494 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:50:56" (3/4) ... [2024-10-14 01:51:13,495 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-14 01:51:13,554 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 01:51:13,556 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 01:51:13,557 INFO L158 Benchmark]: Toolchain (without parser) took 17625.50ms. Allocated memory was 134.2MB in the beginning and 394.3MB in the end (delta: 260.0MB). Free memory was 63.3MB in the beginning and 321.9MB in the end (delta: -258.6MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. [2024-10-14 01:51:13,557 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 134.2MB. Free memory is still 92.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 01:51:13,557 INFO L158 Benchmark]: CACSL2BoogieTranslator took 470.76ms. Allocated memory was 134.2MB in the beginning and 174.1MB in the end (delta: 39.8MB). Free memory was 63.0MB in the beginning and 142.1MB in the end (delta: -79.1MB). Peak memory consumption was 26.4MB. Max. memory is 16.1GB. [2024-10-14 01:51:13,557 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.31ms. Allocated memory is still 174.1MB. Free memory was 141.0MB in the beginning and 140.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 01:51:13,557 INFO L158 Benchmark]: Boogie Preprocessor took 40.55ms. Allocated memory is still 174.1MB. Free memory was 140.0MB in the beginning and 136.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 01:51:13,558 INFO L158 Benchmark]: RCFGBuilder took 357.62ms. Allocated memory is still 174.1MB. Free memory was 136.8MB in the beginning and 121.1MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-14 01:51:13,558 INFO L158 Benchmark]: TraceAbstraction took 16647.90ms. Allocated memory was 174.1MB in the beginning and 394.3MB in the end (delta: 220.2MB). Free memory was 121.1MB in the beginning and 326.1MB in the end (delta: -205.0MB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB. [2024-10-14 01:51:13,558 INFO L158 Benchmark]: Witness Printer took 63.04ms. Allocated memory is still 394.3MB. Free memory was 326.1MB in the beginning and 321.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 01:51:13,560 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 134.2MB. Free memory is still 92.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 470.76ms. Allocated memory was 134.2MB in the beginning and 174.1MB in the end (delta: 39.8MB). Free memory was 63.0MB in the beginning and 142.1MB in the end (delta: -79.1MB). Peak memory consumption was 26.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.31ms. Allocated memory is still 174.1MB. Free memory was 141.0MB in the beginning and 140.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.55ms. Allocated memory is still 174.1MB. Free memory was 140.0MB in the beginning and 136.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 357.62ms. Allocated memory is still 174.1MB. Free memory was 136.8MB in the beginning and 121.1MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 16647.90ms. Allocated memory was 174.1MB in the beginning and 394.3MB in the end (delta: 220.2MB). Free memory was 121.1MB in the beginning and 326.1MB in the end (delta: -205.0MB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB. * Witness Printer took 63.04ms. Allocated memory is still 394.3MB. Free memory was 326.1MB in the beginning and 321.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.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; [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; [L556] RET insert_list(mylist,2) VAL [head={-1:0}, mylist={59:65}] [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={-2:0}] [L544] COND FALSE !(head==((void *)0)) [L547] l->key = k [L548] l->next = head VAL [\old(k)=5, head={-1:0}, l={-2:0}] [L550] head = l [L551] return 0; [L557] RET insert_list(mylist,5) VAL [head={-2:0}, mylist={59:65}] [L558] CALL insert_list(mylist,1) VAL [\old(k)=1, head={-2:0}] [L542] l = (mlist*)malloc(sizeof(mlist)) [L543] l->key = k VAL [\old(k)=1, head={-2: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={-2:0}, l={-3:0}] [L550] head = l [L551] return 0; [L558] RET insert_list(mylist,1) VAL [head={-3:0}, mylist={59:65}] [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; [L559] RET insert_list(mylist,3) VAL [head={-4:0}, mylist={59:65}] [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={-2: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={-2: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; [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, 24 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.5s, OverallIterations: 9, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 330 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 330 mSDsluCounter, 780 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 662 mSDsCounter, 95 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1700 IncrementalHoareTripleChecker+Invalid, 1795 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 95 mSolverCounterUnsat, 118 mSDtfsCounter, 1700 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 471 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1271 ImplicationChecksByTransitivity, 5.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47occurred in iteration=8, InterpolantAutomatonStates: 104, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 28 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 9.4s InterpolantComputationTime, 500 NumberOfCodeBlocks, 500 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 476 ConstructedInterpolants, 8 QuantifiedInterpolants, 4375 SizeOfPredicates, 41 NumberOfNonLiveVariables, 2190 ConjunctsInSsa, 263 ConjunctsInUnsatCore, 15 InterpolantComputations, 4 PerfectInterpolantSequences, 273/402 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-10-14 01:51:13,592 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE