./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-properties/list-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-properties/list-2.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 a135e953d64ed0fec81eb2a1e42f4031e3e387fc71d5a5cd2177772a202dc706 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 22:05:38,480 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 22:05:38,549 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 22:05:38,553 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 22:05:38,554 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 22:05:38,582 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 22:05:38,584 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 22:05:38,585 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 22:05:38,586 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 22:05:38,587 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 22:05:38,587 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 22:05:38,587 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 22:05:38,588 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 22:05:38,588 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 22:05:38,590 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 22:05:38,590 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 22:05:38,591 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 22:05:38,591 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 22:05:38,591 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 22:05:38,591 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 22:05:38,592 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 22:05:38,595 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 22:05:38,596 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 22:05:38,596 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 22:05:38,596 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 22:05:38,596 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 22:05:38,596 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 22:05:38,596 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 22:05:38,597 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 22:05:38,597 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 22:05:38,597 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 22:05:38,597 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 22:05:38,597 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 22:05:38,598 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 22:05:38,598 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 22:05:38,598 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 22:05:38,598 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 22:05:38,598 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 22:05:38,598 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 22:05:38,599 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 22:05:38,599 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 22:05:38,600 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 22:05:38,601 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 -> a135e953d64ed0fec81eb2a1e42f4031e3e387fc71d5a5cd2177772a202dc706 [2024-11-09 22:05:38,885 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 22:05:38,910 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 22:05:38,914 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 22:05:38,915 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 22:05:38,915 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 22:05:38,916 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-properties/list-2.i [2024-11-09 22:05:40,257 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 22:05:40,484 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 22:05:40,485 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list-2.i [2024-11-09 22:05:40,496 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecb01b10d/7ba167f35e934e038382e10748606ef6/FLAG5736527e6 [2024-11-09 22:05:40,508 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecb01b10d/7ba167f35e934e038382e10748606ef6 [2024-11-09 22:05:40,510 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 22:05:40,512 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 22:05:40,513 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 22:05:40,513 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 22:05:40,517 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 22:05:40,518 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:05:40" (1/1) ... [2024-11-09 22:05:40,518 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8f5c59d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:05:40, skipping insertion in model container [2024-11-09 22:05:40,518 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:05:40" (1/1) ... [2024-11-09 22:05:40,556 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 22:05:40,927 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list-2.i[23408,23421] [2024-11-09 22:05:40,938 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 22:05:40,950 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 22:05:40,993 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list-2.i[23408,23421] [2024-11-09 22:05:40,994 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 22:05:41,023 INFO L204 MainTranslator]: Completed translation [2024-11-09 22:05:41,023 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:05:41 WrapperNode [2024-11-09 22:05:41,024 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 22:05:41,025 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 22:05:41,025 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 22:05:41,025 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 22:05:41,031 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:05:41" (1/1) ... [2024-11-09 22:05:41,049 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:05:41" (1/1) ... [2024-11-09 22:05:41,070 INFO L138 Inliner]: procedures = 124, calls = 24, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 76 [2024-11-09 22:05:41,073 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 22:05:41,074 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 22:05:41,074 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 22:05:41,074 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 22:05:41,083 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:05:41" (1/1) ... [2024-11-09 22:05:41,084 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:05:41" (1/1) ... [2024-11-09 22:05:41,091 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:05:41" (1/1) ... [2024-11-09 22:05:41,112 INFO L175 MemorySlicer]: Split 14 memory accesses to 2 slices as follows [2, 12]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 5 writes are split as follows [0, 5]. [2024-11-09 22:05:41,116 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:05:41" (1/1) ... [2024-11-09 22:05:41,116 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:05:41" (1/1) ... [2024-11-09 22:05:41,125 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:05:41" (1/1) ... [2024-11-09 22:05:41,126 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:05:41" (1/1) ... [2024-11-09 22:05:41,127 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:05:41" (1/1) ... [2024-11-09 22:05:41,132 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:05:41" (1/1) ... [2024-11-09 22:05:41,134 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 22:05:41,135 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 22:05:41,139 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 22:05:41,139 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 22:05:41,140 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:05:41" (1/1) ... [2024-11-09 22:05:41,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 22:05:41,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:05:41,173 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 22:05:41,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 22:05:41,225 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-11-09 22:05:41,225 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-11-09 22:05:41,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 22:05:41,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 22:05:41,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 22:05:41,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 22:05:41,227 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 22:05:41,227 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 22:05:41,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 22:05:41,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 22:05:41,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 22:05:41,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 22:05:41,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 22:05:41,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 22:05:41,229 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 22:05:41,229 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 22:05:41,345 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 22:05:41,347 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 22:05:41,377 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-11-09 22:05:41,552 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-09 22:05:41,555 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 22:05:41,567 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 22:05:41,569 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 22:05:41,569 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 10:05:41 BoogieIcfgContainer [2024-11-09 22:05:41,569 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 22:05:41,572 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 22:05:41,573 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 22:05:41,576 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 22:05:41,576 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:05:40" (1/3) ... [2024-11-09 22:05:41,577 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d53178 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:05:41, skipping insertion in model container [2024-11-09 22:05:41,578 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:05:41" (2/3) ... [2024-11-09 22:05:41,578 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d53178 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:05:41, skipping insertion in model container [2024-11-09 22:05:41,579 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 10:05:41" (3/3) ... [2024-11-09 22:05:41,580 INFO L112 eAbstractionObserver]: Analyzing ICFG list-2.i [2024-11-09 22:05:41,595 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 22:05:41,595 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 22:05:41,658 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 22:05:41,663 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;@77ae953f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 22:05:41,663 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 22:05:41,667 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 30 states have internal predecessors, (40), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:05:41,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 22:05:41,673 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:05:41,673 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:05:41,674 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:05:41,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:05:41,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1776747586, now seen corresponding path program 1 times [2024-11-09 22:05:41,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:05:41,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629701766] [2024-11-09 22:05:41,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:05:41,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:05:41,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:05:41,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:05:41,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:05:41,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629701766] [2024-11-09 22:05:41,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629701766] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:05:41,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:05:41,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 22:05:41,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102142837] [2024-11-09 22:05:41,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:05:41,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 22:05:41,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:05:41,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 22:05:41,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 22:05:41,850 INFO L87 Difference]: Start difference. First operand has 32 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 30 states have internal predecessors, (40), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:05:41,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:05:41,863 INFO L93 Difference]: Finished difference Result 53 states and 71 transitions. [2024-11-09 22:05:41,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 22:05:41,865 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-09 22:05:41,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:05:41,870 INFO L225 Difference]: With dead ends: 53 [2024-11-09 22:05:41,870 INFO L226 Difference]: Without dead ends: 22 [2024-11-09 22:05:41,872 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 22:05:41,874 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:05:41,875 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:05:41,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-09 22:05:41,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-11-09 22:05:41,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:05:41,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2024-11-09 22:05:41,898 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 13 [2024-11-09 22:05:41,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:05:41,898 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2024-11-09 22:05:41,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:05:41,898 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2024-11-09 22:05:41,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 22:05:41,899 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:05:41,899 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:05:41,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 22:05:41,900 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:05:41,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:05:41,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1926747034, now seen corresponding path program 1 times [2024-11-09 22:05:41,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:05:41,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123113282] [2024-11-09 22:05:41,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:05:41,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:05:41,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:05:42,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:05:42,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:05:42,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123113282] [2024-11-09 22:05:42,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123113282] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:05:42,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:05:42,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 22:05:42,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425785236] [2024-11-09 22:05:42,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:05:42,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 22:05:42,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:05:42,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 22:05:42,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 22:05:42,208 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:05:42,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:05:42,281 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2024-11-09 22:05:42,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 22:05:42,283 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-09 22:05:42,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:05:42,284 INFO L225 Difference]: With dead ends: 40 [2024-11-09 22:05:42,284 INFO L226 Difference]: Without dead ends: 35 [2024-11-09 22:05:42,284 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 22:05:42,285 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 4 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 22:05:42,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 53 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 22:05:42,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-09 22:05:42,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2024-11-09 22:05:42,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:05:42,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2024-11-09 22:05:42,295 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 17 [2024-11-09 22:05:42,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:05:42,295 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2024-11-09 22:05:42,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:05:42,296 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2024-11-09 22:05:42,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 22:05:42,296 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:05:42,297 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:05:42,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 22:05:42,297 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:05:42,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:05:42,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1900033383, now seen corresponding path program 1 times [2024-11-09 22:05:42,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:05:42,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544900124] [2024-11-09 22:05:42,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:05:42,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:05:42,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:05:42,495 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:05:42,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:05:42,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544900124] [2024-11-09 22:05:42,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544900124] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:05:42,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:05:42,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 22:05:42,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369399304] [2024-11-09 22:05:42,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:05:42,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 22:05:42,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:05:42,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 22:05:42,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 22:05:42,498 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:05:42,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:05:42,577 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2024-11-09 22:05:42,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 22:05:42,577 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-09 22:05:42,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:05:42,578 INFO L225 Difference]: With dead ends: 42 [2024-11-09 22:05:42,578 INFO L226 Difference]: Without dead ends: 33 [2024-11-09 22:05:42,578 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 22:05:42,579 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 5 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 22:05:42,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 56 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 22:05:42,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-09 22:05:42,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2024-11-09 22:05:42,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:05:42,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2024-11-09 22:05:42,586 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 19 [2024-11-09 22:05:42,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:05:42,587 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2024-11-09 22:05:42,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:05:42,587 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2024-11-09 22:05:42,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 22:05:42,588 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:05:42,588 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:05:42,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 22:05:42,588 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:05:42,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:05:42,589 INFO L85 PathProgramCache]: Analyzing trace with hash -98000167, now seen corresponding path program 1 times [2024-11-09 22:05:42,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:05:42,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747981561] [2024-11-09 22:05:42,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:05:42,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:05:42,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:05:42,737 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:05:42,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:05:42,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747981561] [2024-11-09 22:05:42,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747981561] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:05:42,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:05:42,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 22:05:42,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855440966] [2024-11-09 22:05:42,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:05:42,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 22:05:42,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:05:42,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 22:05:42,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 22:05:42,742 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:05:42,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:05:42,807 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2024-11-09 22:05:42,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 22:05:42,810 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-09 22:05:42,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:05:42,810 INFO L225 Difference]: With dead ends: 42 [2024-11-09 22:05:42,810 INFO L226 Difference]: Without dead ends: 30 [2024-11-09 22:05:42,811 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 22:05:42,812 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 5 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 22:05:42,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 60 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 22:05:42,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-09 22:05:42,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2024-11-09 22:05:42,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:05:42,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2024-11-09 22:05:42,821 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 19 [2024-11-09 22:05:42,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:05:42,822 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2024-11-09 22:05:42,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:05:42,822 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2024-11-09 22:05:42,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 22:05:42,823 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:05:42,823 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:05:42,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 22:05:42,824 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:05:42,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:05:42,824 INFO L85 PathProgramCache]: Analyzing trace with hash -550473026, now seen corresponding path program 1 times [2024-11-09 22:05:42,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:05:42,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885278110] [2024-11-09 22:05:42,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:05:42,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:05:42,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:05:43,141 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:05:43,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:05:43,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885278110] [2024-11-09 22:05:43,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885278110] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:05:43,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1741693268] [2024-11-09 22:05:43,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:05:43,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:05:43,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:05:43,147 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:05:43,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 22:05:43,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:05:43,262 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-09 22:05:43,267 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:05:43,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 22:05:43,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 22:05:43,395 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 22:05:43,395 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 11 treesize of output 11 [2024-11-09 22:05:43,451 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 27 treesize of output 11 [2024-11-09 22:05:43,471 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 16 treesize of output 11 [2024-11-09 22:05:43,492 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:05:43,492 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:05:43,512 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_81 (Array Int Int))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_81) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) is different from false [2024-11-09 22:05:43,551 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_79 (Array Int Int)) (v_ArrVal_81 (Array Int Int))) (or (= 2 (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_79) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_81) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 (select v_ArrVal_79 .cse0))) v_ArrVal_79)))) is different from false [2024-11-09 22:05:43,601 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:05:43,602 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 74 [2024-11-09 22:05:43,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2024-11-09 22:05:43,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-09 22:05:43,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 98 [2024-11-09 22:05:43,831 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-09 22:05:43,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1741693268] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:05:43,832 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 22:05:43,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2024-11-09 22:05:43,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964200655] [2024-11-09 22:05:43,832 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 22:05:43,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 22:05:43,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:05:43,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 22:05:43,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=85, Unknown=2, NotChecked=38, Total=156 [2024-11-09 22:05:43,834 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:05:44,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:05:44,013 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2024-11-09 22:05:44,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 22:05:44,014 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-09 22:05:44,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:05:44,015 INFO L225 Difference]: With dead ends: 44 [2024-11-09 22:05:44,015 INFO L226 Difference]: Without dead ends: 37 [2024-11-09 22:05:44,016 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=158, Unknown=2, NotChecked=54, Total=272 [2024-11-09 22:05:44,016 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 35 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 67 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 22:05:44,017 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 98 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 87 Invalid, 0 Unknown, 67 Unchecked, 0.1s Time] [2024-11-09 22:05:44,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-09 22:05:44,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2024-11-09 22:05:44,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.1875) internal successors, (38), 32 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:05:44,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2024-11-09 22:05:44,025 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 21 [2024-11-09 22:05:44,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:05:44,027 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2024-11-09 22:05:44,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:05:44,027 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2024-11-09 22:05:44,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 22:05:44,028 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:05:44,028 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:05:44,051 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 22:05:44,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:05:44,229 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:05:44,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:05:44,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1984737470, now seen corresponding path program 1 times [2024-11-09 22:05:44,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:05:44,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960323534] [2024-11-09 22:05:44,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:05:44,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:05:44,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:05:44,517 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:05:44,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:05:44,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960323534] [2024-11-09 22:05:44,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960323534] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:05:44,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [910165167] [2024-11-09 22:05:44,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:05:44,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:05:44,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:05:44,520 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:05:44,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 22:05:44,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:05:44,598 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-09 22:05:44,600 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:05:44,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 22:05:44,641 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 22:05:44,642 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 11 treesize of output 11 [2024-11-09 22:05:44,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 22:05:44,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-09 22:05:44,720 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 16 treesize of output 11 [2024-11-09 22:05:44,730 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:05:44,731 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:05:44,749 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_133 (Array Int Int))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_133) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2024-11-09 22:05:44,798 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:05:44,799 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2024-11-09 22:05:44,809 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:05:44,809 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 33 [2024-11-09 22:05:44,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2024-11-09 22:05:44,888 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-09 22:05:44,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [910165167] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:05:44,889 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 22:05:44,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12 [2024-11-09 22:05:44,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530718268] [2024-11-09 22:05:44,889 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 22:05:44,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 22:05:44,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:05:44,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 22:05:44,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=84, Unknown=2, NotChecked=18, Total=132 [2024-11-09 22:05:44,890 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:05:45,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:05:45,133 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2024-11-09 22:05:45,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 22:05:45,133 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-09 22:05:45,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:05:45,136 INFO L225 Difference]: With dead ends: 49 [2024-11-09 22:05:45,136 INFO L226 Difference]: Without dead ends: 44 [2024-11-09 22:05:45,137 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=180, Unknown=2, NotChecked=28, Total=272 [2024-11-09 22:05:45,137 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 19 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 33 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 22:05:45,137 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 118 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 142 Invalid, 0 Unknown, 33 Unchecked, 0.2s Time] [2024-11-09 22:05:45,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-09 22:05:45,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2024-11-09 22:05:45,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 41 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:05:45,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2024-11-09 22:05:45,145 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 21 [2024-11-09 22:05:45,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:05:45,145 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2024-11-09 22:05:45,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:05:45,145 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2024-11-09 22:05:45,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 22:05:45,146 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:05:45,146 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:05:45,162 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-11-09 22:05:45,346 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,SelfDestructingSolverStorable5 [2024-11-09 22:05:45,347 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:05:45,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:05:45,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1294595843, now seen corresponding path program 1 times [2024-11-09 22:05:45,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:05:45,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971187647] [2024-11-09 22:05:45,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:05:45,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:05:45,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:05:45,709 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:05:45,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:05:45,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971187647] [2024-11-09 22:05:45,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971187647] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:05:45,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1317805389] [2024-11-09 22:05:45,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:05:45,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:05:45,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:05:45,713 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:05:45,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 22:05:45,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:05:45,791 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-09 22:05:45,793 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:05:45,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 22:05:45,857 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 22:05:45,857 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 11 treesize of output 11 [2024-11-09 22:05:45,887 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 19 treesize of output 1 [2024-11-09 22:05:45,892 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 19 treesize of output 1 [2024-11-09 22:05:45,940 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 22:05:45,940 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 73 [2024-11-09 22:05:45,946 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 29 treesize of output 19 [2024-11-09 22:05:45,950 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 40 treesize of output 23 [2024-11-09 22:05:45,979 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 39 treesize of output 21 [2024-11-09 22:05:45,982 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 23 treesize of output 11 [2024-11-09 22:05:45,994 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:05:45,994 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:05:46,027 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 79 treesize of output 57 [2024-11-09 22:05:46,098 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:05:46,098 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2024-11-09 22:05:46,106 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:05:46,106 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 31 [2024-11-09 22:05:46,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 22:05:46,124 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-09 22:05:46,124 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2024-11-09 22:05:46,223 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:05:46,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1317805389] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:05:46,223 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 22:05:46,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2024-11-09 22:05:46,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662520392] [2024-11-09 22:05:46,223 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 22:05:46,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 22:05:46,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:05:46,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 22:05:46,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=249, Unknown=6, NotChecked=0, Total=306 [2024-11-09 22:05:46,225 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand has 18 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 18 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:05:46,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:05:46,438 INFO L93 Difference]: Finished difference Result 68 states and 79 transitions. [2024-11-09 22:05:46,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 22:05:46,439 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 18 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-09 22:05:46,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:05:46,440 INFO L225 Difference]: With dead ends: 68 [2024-11-09 22:05:46,440 INFO L226 Difference]: Without dead ends: 63 [2024-11-09 22:05:46,440 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=339, Unknown=7, NotChecked=0, Total=420 [2024-11-09 22:05:46,441 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 53 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 22:05:46,441 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 140 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 22:05:46,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-09 22:05:46,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 53. [2024-11-09 22:05:46,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.2115384615384615) internal successors, (63), 52 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:05:46,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2024-11-09 22:05:46,450 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 23 [2024-11-09 22:05:46,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:05:46,450 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2024-11-09 22:05:46,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 18 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:05:46,450 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2024-11-09 22:05:46,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 22:05:46,451 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:05:46,451 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:05:46,468 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 22:05:46,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:05:46,652 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:05:46,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:05:46,653 INFO L85 PathProgramCache]: Analyzing trace with hash -939117764, now seen corresponding path program 1 times [2024-11-09 22:05:46,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:05:46,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48487] [2024-11-09 22:05:46,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:05:46,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:05:46,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:05:46,955 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:05:46,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:05:46,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48487] [2024-11-09 22:05:46,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48487] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:05:46,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [645315385] [2024-11-09 22:05:46,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:05:46,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:05:46,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:05:46,957 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:05:46,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 22:05:47,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:05:47,040 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-09 22:05:47,043 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:05:47,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 22:05:47,105 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 22:05:47,105 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 11 treesize of output 11 [2024-11-09 22:05:47,146 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 19 treesize of output 1 [2024-11-09 22:05:47,151 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 19 treesize of output 1 [2024-11-09 22:05:47,198 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 22:05:47,198 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 73 [2024-11-09 22:05:47,204 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 29 treesize of output 19 [2024-11-09 22:05:47,207 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 40 treesize of output 23 [2024-11-09 22:05:47,237 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 39 treesize of output 21 [2024-11-09 22:05:47,240 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 23 treesize of output 11 [2024-11-09 22:05:47,256 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:05:47,256 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:05:47,310 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 52 treesize of output 30 [2024-11-09 22:05:47,316 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_231 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_231) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (forall ((v_ArrVal_233 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_233) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.base|)))) is different from false [2024-11-09 22:05:47,335 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:05:47,336 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2024-11-09 22:05:47,344 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:05:47,344 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2024-11-09 22:05:47,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 22:05:47,360 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-09 22:05:47,360 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2024-11-09 22:05:47,452 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-09 22:05:47,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [645315385] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:05:47,452 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 22:05:47,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2024-11-09 22:05:47,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985850667] [2024-11-09 22:05:47,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 22:05:47,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-09 22:05:47,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:05:47,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-09 22:05:47,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=290, Unknown=1, NotChecked=34, Total=380 [2024-11-09 22:05:47,455 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand has 20 states, 20 states have (on average 2.8) internal successors, (56), 20 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:05:47,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:05:47,794 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2024-11-09 22:05:47,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 22:05:47,794 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.8) internal successors, (56), 20 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-09 22:05:47,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:05:47,795 INFO L225 Difference]: With dead ends: 70 [2024-11-09 22:05:47,795 INFO L226 Difference]: Without dead ends: 59 [2024-11-09 22:05:47,796 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=541, Unknown=1, NotChecked=48, Total=702 [2024-11-09 22:05:47,797 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 37 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 45 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 22:05:47,797 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 196 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 256 Invalid, 0 Unknown, 45 Unchecked, 0.2s Time] [2024-11-09 22:05:47,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-09 22:05:47,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 50. [2024-11-09 22:05:47,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 49 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:05:47,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2024-11-09 22:05:47,802 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 25 [2024-11-09 22:05:47,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:05:47,802 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2024-11-09 22:05:47,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.8) internal successors, (56), 20 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:05:47,802 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2024-11-09 22:05:47,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 22:05:47,803 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:05:47,803 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:05:47,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-09 22:05:48,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:05:48,004 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:05:48,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:05:48,004 INFO L85 PathProgramCache]: Analyzing trace with hash 862915452, now seen corresponding path program 2 times [2024-11-09 22:05:48,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:05:48,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90732733] [2024-11-09 22:05:48,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:05:48,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:05:48,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:05:48,320 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:05:48,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:05:48,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90732733] [2024-11-09 22:05:48,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90732733] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:05:48,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2033156410] [2024-11-09 22:05:48,321 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 22:05:48,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:05:48,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:05:48,322 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:05:48,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 22:05:48,403 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 22:05:48,403 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 22:05:48,404 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-09 22:05:48,407 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:05:48,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 22:05:48,465 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 22:05:48,465 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 11 treesize of output 11 [2024-11-09 22:05:48,486 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 15 treesize of output 1 [2024-11-09 22:05:48,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 22:05:48,528 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 22:05:48,529 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 57 [2024-11-09 22:05:48,533 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 23 treesize of output 15 [2024-11-09 22:05:48,539 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 32 treesize of output 19 [2024-11-09 22:05:48,577 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 31 treesize of output 19 [2024-11-09 22:05:48,580 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 19 treesize of output 11 [2024-11-09 22:05:48,585 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:05:48,585 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:05:48,632 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 52 treesize of output 30 [2024-11-09 22:05:48,638 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_281 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_281) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (forall ((v_ArrVal_282 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_282) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.base|)))) is different from false [2024-11-09 22:05:48,667 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:05:48,667 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2024-11-09 22:05:48,675 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:05:48,675 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 31 [2024-11-09 22:05:48,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 22:05:48,691 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-09 22:05:48,691 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2024-11-09 22:05:48,804 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-09 22:05:48,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2033156410] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:05:48,805 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 22:05:48,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2024-11-09 22:05:48,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064410141] [2024-11-09 22:05:48,805 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 22:05:48,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 22:05:48,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:05:48,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 22:05:48,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=201, Unknown=1, NotChecked=28, Total=272 [2024-11-09 22:05:48,806 INFO L87 Difference]: Start difference. First operand 50 states and 59 transitions. Second operand has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:05:49,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:05:49,049 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2024-11-09 22:05:49,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 22:05:49,049 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-09 22:05:49,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:05:49,051 INFO L225 Difference]: With dead ends: 65 [2024-11-09 22:05:49,051 INFO L226 Difference]: Without dead ends: 51 [2024-11-09 22:05:49,051 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=380, Unknown=1, NotChecked=40, Total=506 [2024-11-09 22:05:49,052 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 53 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 39 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 22:05:49,052 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 146 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 162 Invalid, 0 Unknown, 39 Unchecked, 0.1s Time] [2024-11-09 22:05:49,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-09 22:05:49,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2024-11-09 22:05:49,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 44 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:05:49,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2024-11-09 22:05:49,059 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 25 [2024-11-09 22:05:49,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:05:49,059 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2024-11-09 22:05:49,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:05:49,060 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2024-11-09 22:05:49,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 22:05:49,060 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:05:49,060 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:05:49,072 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 22:05:49,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:05:49,261 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:05:49,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:05:49,262 INFO L85 PathProgramCache]: Analyzing trace with hash 572317666, now seen corresponding path program 2 times [2024-11-09 22:05:49,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:05:49,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908150088] [2024-11-09 22:05:49,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:05:49,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:05:49,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:05:49,582 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:05:49,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:05:49,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908150088] [2024-11-09 22:05:49,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908150088] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:05:49,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1396296842] [2024-11-09 22:05:49,583 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 22:05:49,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:05:49,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:05:49,585 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:05:49,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 22:05:49,674 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 22:05:49,674 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 22:05:49,675 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-09 22:05:49,678 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:05:49,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 22:05:49,759 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-09 22:05:49,759 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 19 treesize of output 16 [2024-11-09 22:05:49,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 22:05:49,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 22:05:49,875 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 16 treesize of output 11 [2024-11-09 22:05:49,884 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 22:05:49,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 22:05:49,930 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 16 treesize of output 11 [2024-11-09 22:05:49,972 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 19 treesize of output 18 [2024-11-09 22:05:50,036 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:05:50,036 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:05:50,149 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~t~0#1.base_34| Int) (v_ArrVal_364 (Array Int Int))) (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_364))) (or (= (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_34|) 0)) (= 3 (select (select (store .cse0 |v_ULTIMATE.start_main_~t~0#1.base_34| (store (select .cse0 |v_ULTIMATE.start_main_~t~0#1.base_34|) 0 3)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))))) is different from false [2024-11-09 22:05:50,181 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_360 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_34| Int) (v_ArrVal_364 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_360) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_364))) (or (= (select (select (store .cse0 |v_ULTIMATE.start_main_~t~0#1.base_34| (store (select .cse0 |v_ULTIMATE.start_main_~t~0#1.base_34|) 0 3)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 3) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_34|) 0)) (not (= v_ArrVal_360 (let ((.cse1 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base|) .cse1 (select v_ArrVal_360 .cse1))))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)))) is different from false [2024-11-09 22:05:50,231 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:05:50,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2297 treesize of output 2251 [2024-11-09 22:05:50,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 654 treesize of output 618 [2024-11-09 22:05:51,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 503 treesize of output 483 [2024-11-09 22:05:51,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 265 treesize of output 257 [2024-11-09 22:05:51,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:05:51,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:05:51,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:05:51,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:05:51,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2024-11-09 22:05:51,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 279 treesize of output 263 [2024-11-09 22:05:51,682 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-09 22:05:51,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 60 [2024-11-09 22:05:52,278 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-09 22:05:52,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1396296842] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:05:52,278 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 22:05:52,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 12] total 24 [2024-11-09 22:05:52,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312637513] [2024-11-09 22:05:52,279 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 22:05:52,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-09 22:05:52,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:05:52,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-09 22:05:52,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=377, Unknown=2, NotChecked=82, Total=552 [2024-11-09 22:05:52,281 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand has 24 states, 24 states have (on average 2.375) internal successors, (57), 24 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:05:52,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:05:52,519 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2024-11-09 22:05:52,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 22:05:52,521 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.375) internal successors, (57), 24 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-09 22:05:52,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:05:52,521 INFO L225 Difference]: With dead ends: 56 [2024-11-09 22:05:52,521 INFO L226 Difference]: Without dead ends: 49 [2024-11-09 22:05:52,522 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=136, Invalid=520, Unknown=2, NotChecked=98, Total=756 [2024-11-09 22:05:52,523 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 25 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 78 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 22:05:52,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 154 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 198 Invalid, 0 Unknown, 78 Unchecked, 0.1s Time] [2024-11-09 22:05:52,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-09 22:05:52,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2024-11-09 22:05:52,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.173913043478261) internal successors, (54), 46 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:05:52,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2024-11-09 22:05:52,529 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 25 [2024-11-09 22:05:52,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:05:52,529 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2024-11-09 22:05:52,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.375) internal successors, (57), 24 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:05:52,529 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2024-11-09 22:05:52,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 22:05:52,530 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:05:52,530 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:05:52,542 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-09 22:05:52,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:05:52,732 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:05:52,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:05:52,732 INFO L85 PathProgramCache]: Analyzing trace with hash -329532127, now seen corresponding path program 3 times [2024-11-09 22:05:52,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:05:52,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865841590] [2024-11-09 22:05:52,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:05:52,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:05:52,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:05:53,289 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:05:53,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:05:53,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865841590] [2024-11-09 22:05:53,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865841590] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:05:53,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1762905258] [2024-11-09 22:05:53,290 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 22:05:53,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:05:53,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:05:53,292 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:05:53,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 22:05:53,388 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-09 22:05:53,389 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 22:05:53,395 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-11-09 22:05:53,398 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:05:53,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 22:05:53,453 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 22:05:53,453 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 17 treesize of output 21 [2024-11-09 22:05:53,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 22:05:53,518 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 15 treesize of output 1 [2024-11-09 22:05:53,582 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 22:05:53,583 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 16 treesize of output 15 [2024-11-09 22:05:53,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 22:05:53,603 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-09 22:05:53,604 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 33 treesize of output 24 [2024-11-09 22:05:53,618 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-11-09 22:05:53,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-11-09 22:05:53,685 INFO L349 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2024-11-09 22:05:53,686 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 129 treesize of output 79 [2024-11-09 22:05:53,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2024-11-09 22:05:53,702 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 24 treesize of output 11 [2024-11-09 22:05:53,760 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2024-11-09 22:05:53,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 112 treesize of output 77 [2024-11-09 22:05:53,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2024-11-09 22:05:53,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 11 [2024-11-09 22:05:53,826 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 22:05:53,826 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 47 treesize of output 26 [2024-11-09 22:05:53,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 22:05:53,874 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:05:53,874 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:05:53,904 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_449 (Array Int Int)) (v_ArrVal_448 (Array Int Int)) (v_ArrVal_450 (Array Int Int))) (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_448) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_450) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_449) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) 2)) is different from false [2024-11-09 22:05:53,924 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_447 (Array Int Int)) (v_ArrVal_446 (Array Int Int)) (v_ArrVal_449 (Array Int Int)) (v_ArrVal_448 (Array Int Int)) (v_ArrVal_450 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (or (= 2 (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_447) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_448) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 |c_ULTIMATE.start_main_~t~0#1.base|)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_450) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_446) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_449) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))) (not (= v_ArrVal_447 (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 (select v_ArrVal_447 .cse0))))))) is different from false [2024-11-09 22:05:53,944 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:05:53,945 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 42 treesize of output 46 [2024-11-09 22:05:53,953 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:05:53,954 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 262 treesize of output 266 [2024-11-09 22:05:53,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 226 treesize of output 190 [2024-11-09 22:05:54,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 527 treesize of output 473 [2024-11-09 22:05:54,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2024-11-09 22:05:54,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2024-11-09 22:05:54,193 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:05:54,193 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2024-11-09 22:05:54,202 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:05:54,202 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 69 [2024-11-09 22:05:54,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2024-11-09 22:05:54,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2024-11-09 22:05:54,253 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:05:54,253 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2024-11-09 22:05:54,255 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 22:05:54,261 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:05:54,262 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 46 [2024-11-09 22:05:54,270 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:05:54,270 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 41 treesize of output 33 [2024-11-09 22:05:54,300 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:05:54,300 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2024-11-09 22:05:54,303 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 22:05:54,309 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:05:54,310 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2024-11-09 22:05:54,320 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:05:54,321 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 22 treesize of output 22 [2024-11-09 22:05:54,347 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:05:54,347 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2024-11-09 22:05:54,354 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 22:05:54,361 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:05:54,361 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 42 [2024-11-09 22:05:54,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2024-11-09 22:05:55,031 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-09 22:05:55,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1762905258] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:05:55,032 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 22:05:55,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 26 [2024-11-09 22:05:55,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044609222] [2024-11-09 22:05:55,032 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 22:05:55,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-09 22:05:55,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:05:55,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-09 22:05:55,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=477, Unknown=2, NotChecked=90, Total=650 [2024-11-09 22:05:55,034 INFO L87 Difference]: Start difference. First operand 47 states and 54 transitions. Second operand has 26 states, 26 states have (on average 2.269230769230769) internal successors, (59), 26 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:05:55,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:05:55,421 INFO L93 Difference]: Finished difference Result 81 states and 93 transitions. [2024-11-09 22:05:55,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 22:05:55,421 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.269230769230769) internal successors, (59), 26 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-09 22:05:55,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:05:55,422 INFO L225 Difference]: With dead ends: 81 [2024-11-09 22:05:55,422 INFO L226 Difference]: Without dead ends: 74 [2024-11-09 22:05:55,423 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=126, Invalid=692, Unknown=2, NotChecked=110, Total=930 [2024-11-09 22:05:55,423 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 33 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 103 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 22:05:55,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 256 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 414 Invalid, 0 Unknown, 103 Unchecked, 0.3s Time] [2024-11-09 22:05:55,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-09 22:05:55,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 61. [2024-11-09 22:05:55,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 60 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:05:55,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 71 transitions. [2024-11-09 22:05:55,429 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 71 transitions. Word has length 27 [2024-11-09 22:05:55,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:05:55,429 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 71 transitions. [2024-11-09 22:05:55,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.269230769230769) internal successors, (59), 26 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:05:55,430 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2024-11-09 22:05:55,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 22:05:55,430 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:05:55,430 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:05:55,448 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-09 22:05:55,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:05:55,635 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:05:55,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:05:55,635 INFO L85 PathProgramCache]: Analyzing trace with hash 359178977, now seen corresponding path program 1 times [2024-11-09 22:05:55,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:05:55,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344977083] [2024-11-09 22:05:55,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:05:55,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:05:55,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 22:05:55,655 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 22:05:55,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 22:05:55,687 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 22:05:55,688 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 22:05:55,690 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 22:05:55,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 22:05:55,694 INFO L407 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:05:55,722 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 22:05:55,724 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 10:05:55 BoogieIcfgContainer [2024-11-09 22:05:55,724 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 22:05:55,725 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 22:05:55,725 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 22:05:55,725 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 22:05:55,726 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 10:05:41" (3/4) ... [2024-11-09 22:05:55,726 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-09 22:05:55,773 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 22:05:55,774 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 22:05:55,774 INFO L158 Benchmark]: Toolchain (without parser) took 15262.85ms. Allocated memory was 172.0MB in the beginning and 373.3MB in the end (delta: 201.3MB). Free memory was 98.7MB in the beginning and 245.8MB in the end (delta: -147.1MB). Peak memory consumption was 56.3MB. Max. memory is 16.1GB. [2024-11-09 22:05:55,775 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 172.0MB. Free memory is still 145.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 22:05:55,775 INFO L158 Benchmark]: CACSL2BoogieTranslator took 510.92ms. Allocated memory is still 172.0MB. Free memory was 98.5MB in the beginning and 128.7MB in the end (delta: -30.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 22:05:55,775 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.74ms. Allocated memory is still 172.0MB. Free memory was 128.7MB in the beginning and 127.4MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 22:05:55,775 INFO L158 Benchmark]: Boogie Preprocessor took 60.41ms. Allocated memory is still 172.0MB. Free memory was 126.6MB in the beginning and 124.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 22:05:55,776 INFO L158 Benchmark]: IcfgBuilder took 435.06ms. Allocated memory is still 172.0MB. Free memory was 124.5MB in the beginning and 109.8MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 22:05:55,776 INFO L158 Benchmark]: TraceAbstraction took 14152.52ms. Allocated memory was 172.0MB in the beginning and 373.3MB in the end (delta: 201.3MB). Free memory was 109.0MB in the beginning and 247.9MB in the end (delta: -139.0MB). Peak memory consumption was 65.1MB. Max. memory is 16.1GB. [2024-11-09 22:05:55,776 INFO L158 Benchmark]: Witness Printer took 48.99ms. Allocated memory is still 373.3MB. Free memory was 247.9MB in the beginning and 245.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 22:05:55,777 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.19ms. Allocated memory is still 172.0MB. Free memory is still 145.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 510.92ms. Allocated memory is still 172.0MB. Free memory was 98.5MB in the beginning and 128.7MB in the end (delta: -30.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.74ms. Allocated memory is still 172.0MB. Free memory was 128.7MB in the beginning and 127.4MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 60.41ms. Allocated memory is still 172.0MB. Free memory was 126.6MB in the beginning and 124.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 435.06ms. Allocated memory is still 172.0MB. Free memory was 124.5MB in the beginning and 109.8MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 14152.52ms. Allocated memory was 172.0MB in the beginning and 373.3MB in the end (delta: 201.3MB). Free memory was 109.0MB in the beginning and 247.9MB in the end (delta: -139.0MB). Peak memory consumption was 65.1MB. Max. memory is 16.1GB. * Witness Printer took 48.99ms. Allocated memory is still 373.3MB. Free memory was 247.9MB in the beginning and 245.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 557]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L532] List a = (List) malloc(sizeof(struct node)); [L533] COND FALSE !(a == 0) VAL [a={-1:0}] [L534] List t; [L535] List p = a; VAL [a={-1:0}, p={-1:0}] [L536] COND TRUE __VERIFIER_nondet_int() [L537] p->h = 1 [L538] t = (List) malloc(sizeof(struct node)) [L539] COND FALSE !(t == 0) VAL [a={-1:0}, p={-1:0}, t={-2:0}] [L540] p->n = t [L541] EXPR p->n [L541] p = p->n [L536] COND FALSE !(__VERIFIER_nondet_int()) [L543] COND TRUE __VERIFIER_nondet_int() [L544] p->h = 2 [L545] t = (List) malloc(sizeof(struct node)) [L546] COND FALSE !(t == 0) VAL [a={-1:0}, p={-2:0}, t={-3:0}] [L547] p->n = t [L548] EXPR p->n [L548] p = p->n [L543] COND FALSE !(__VERIFIER_nondet_int()) [L550] p->h = 3 [L551] p = a VAL [p={-1:0}] [L552] EXPR p->h [L552] COND FALSE !(p->h == 2) [L554] EXPR p->h [L554] COND TRUE p->h == 1 [L555] EXPR p->n [L555] p = p->n VAL [p={-2:0}] [L554] EXPR p->h [L554] COND FALSE !(p->h == 1) [L556] EXPR p->h [L556] COND TRUE p->h != 3 [L557] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.1s, OverallIterations: 12, TraceHistogramMax: 3, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 269 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 269 mSDsluCounter, 1314 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 365 IncrementalHoareTripleChecker+Unchecked, 1102 mSDsCounter, 107 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1593 IncrementalHoareTripleChecker+Invalid, 2065 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 107 mSolverCounterUnsat, 212 mSDtfsCounter, 1593 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 445 GetRequests, 279 SyntacticMatches, 5 SemanticMatches, 161 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 538 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61occurred in iteration=11, InterpolantAutomatonStates: 96, 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, 11 MinimizatonAttempts, 58 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 9.3s InterpolantComputationTime, 429 NumberOfCodeBlocks, 429 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 544 ConstructedInterpolants, 68 QuantifiedInterpolants, 8437 SizeOfPredicates, 43 NumberOfNonLiveVariables, 951 ConjunctsInSsa, 277 ConjunctsInUnsatCore, 25 InterpolantComputations, 4 PerfectInterpolantSequences, 22/124 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-09 22:05:55,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE