./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/list-simple/dll2c_append_unequal.i --full-output --preprocessor.use.memory.slicer false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6ae2ee47 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/list-simple/dll2c_append_unequal.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 9aabbeff87ba819b44dc608a3105d0ba81b71cd88693ecf2e6bf3860a7863e64 --preprocessor.use.memory.slicer false --- Real Ultimate output --- This is Ultimate 0.2.3-dev-6ae2ee4-m [2023-11-22 21:11:57,709 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-22 21:11:57,831 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-22 21:11:57,837 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-22 21:11:57,838 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-22 21:11:57,874 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-22 21:11:57,874 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-22 21:11:57,874 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-22 21:11:57,875 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-22 21:11:57,878 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-22 21:11:57,879 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-22 21:11:57,879 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-22 21:11:57,880 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-22 21:11:57,881 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-22 21:11:57,881 INFO L153 SettingsManager]: * Use SBE=true [2023-11-22 21:11:57,881 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-22 21:11:57,881 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-22 21:11:57,882 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-22 21:11:57,882 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-22 21:11:57,882 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-22 21:11:57,882 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-22 21:11:57,883 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-22 21:11:57,883 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-22 21:11:57,883 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-22 21:11:57,883 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-22 21:11:57,884 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-22 21:11:57,884 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-22 21:11:57,884 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-22 21:11:57,885 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-22 21:11:57,885 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-22 21:11:57,886 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-22 21:11:57,887 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 21:11:57,887 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-22 21:11:57,887 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-22 21:11:57,887 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-22 21:11:57,888 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-22 21:11:57,888 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-22 21:11:57,888 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-22 21:11:57,888 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-22 21:11:57,889 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-22 21:11:57,889 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-22 21:11:57,889 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-22 21:11:57,889 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 -> 9aabbeff87ba819b44dc608a3105d0ba81b71cd88693ecf2e6bf3860a7863e64 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> false [2023-11-22 21:11:58,163 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-22 21:11:58,185 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-22 21:11:58,187 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-22 21:11:58,188 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-22 21:11:58,189 INFO L274 PluginConnector]: CDTParser initialized [2023-11-22 21:11:58,190 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2c_append_unequal.i [2023-11-22 21:11:59,331 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-22 21:11:59,504 INFO L384 CDTParser]: Found 1 translation units. [2023-11-22 21:11:59,504 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_append_unequal.i [2023-11-22 21:11:59,513 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac17b90bb/106a080c1ac84bcab2296e986a7766b8/FLAGb3c9a1eda [2023-11-22 21:11:59,525 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac17b90bb/106a080c1ac84bcab2296e986a7766b8 [2023-11-22 21:11:59,527 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-22 21:11:59,528 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-22 21:11:59,529 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-22 21:11:59,529 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-22 21:11:59,541 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-22 21:11:59,542 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:11:59" (1/1) ... [2023-11-22 21:11:59,542 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cebdda1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:11:59, skipping insertion in model container [2023-11-22 21:11:59,542 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:11:59" (1/1) ... [2023-11-22 21:11:59,586 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-22 21:11:59,855 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_append_unequal.i[24672,24685] [2023-11-22 21:11:59,859 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 21:11:59,869 INFO L202 MainTranslator]: Completed pre-run [2023-11-22 21:11:59,920 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_append_unequal.i[24672,24685] [2023-11-22 21:11:59,925 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 21:11:59,943 INFO L206 MainTranslator]: Completed translation [2023-11-22 21:11:59,947 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:11:59 WrapperNode [2023-11-22 21:11:59,947 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-22 21:11:59,948 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-22 21:11:59,948 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-22 21:11:59,948 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-22 21:11:59,953 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:11:59" (1/1) ... [2023-11-22 21:11:59,964 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:11:59" (1/1) ... [2023-11-22 21:11:59,983 INFO L138 Inliner]: procedures = 127, calls = 49, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 149 [2023-11-22 21:11:59,983 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-22 21:11:59,983 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-22 21:11:59,984 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-22 21:11:59,984 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-22 21:11:59,990 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:11:59" (1/1) ... [2023-11-22 21:11:59,991 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:11:59" (1/1) ... [2023-11-22 21:11:59,995 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:11:59" (1/1) ... [2023-11-22 21:12:00,003 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:11:59" (1/1) ... [2023-11-22 21:12:00,009 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:11:59" (1/1) ... [2023-11-22 21:12:00,012 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:11:59" (1/1) ... [2023-11-22 21:12:00,016 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:11:59" (1/1) ... [2023-11-22 21:12:00,021 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:11:59" (1/1) ... [2023-11-22 21:12:00,024 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-22 21:12:00,024 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-22 21:12:00,025 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-22 21:12:00,025 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-22 21:12:00,025 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:11:59" (1/1) ... [2023-11-22 21:12:00,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 21:12:00,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 21:12:00,066 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-22 21:12:00,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-22 21:12:00,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-22 21:12:00,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-22 21:12:00,111 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-22 21:12:00,111 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-22 21:12:00,112 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-22 21:12:00,112 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-22 21:12:00,112 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-22 21:12:00,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-22 21:12:00,112 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-22 21:12:00,114 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-22 21:12:00,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-22 21:12:00,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-22 21:12:00,114 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-22 21:12:00,114 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-22 21:12:00,237 INFO L241 CfgBuilder]: Building ICFG [2023-11-22 21:12:00,239 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-22 21:12:00,418 INFO L282 CfgBuilder]: Performing block encoding [2023-11-22 21:12:00,443 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-22 21:12:00,443 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-22 21:12:00,444 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:12:00 BoogieIcfgContainer [2023-11-22 21:12:00,444 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-22 21:12:00,445 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-22 21:12:00,445 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-22 21:12:00,447 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-22 21:12:00,448 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 09:11:59" (1/3) ... [2023-11-22 21:12:00,448 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4245f9e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:12:00, skipping insertion in model container [2023-11-22 21:12:00,448 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:11:59" (2/3) ... [2023-11-22 21:12:00,448 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4245f9e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:12:00, skipping insertion in model container [2023-11-22 21:12:00,448 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:12:00" (3/3) ... [2023-11-22 21:12:00,449 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_append_unequal.i [2023-11-22 21:12:00,465 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-22 21:12:00,465 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-22 21:12:00,498 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-22 21:12:00,502 INFO L357 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, mHoare=true, 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;@51ac3191, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-22 21:12:00,503 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-22 21:12:00,506 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 25 states have (on average 1.56) internal successors, (39), 26 states have internal predecessors, (39), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-22 21:12:00,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-22 21:12:00,511 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:12:00,511 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 21:12:00,511 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:12:00,515 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:12:00,516 INFO L85 PathProgramCache]: Analyzing trace with hash -977421440, now seen corresponding path program 1 times [2023-11-22 21:12:00,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:12:00,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226000952] [2023-11-22 21:12:00,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:12:00,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:12:00,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:12:00,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:12:00,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:12:00,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-22 21:12:00,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:12:00,807 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-22 21:12:00,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:12:00,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226000952] [2023-11-22 21:12:00,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226000952] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:12:00,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:12:00,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-22 21:12:00,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426613221] [2023-11-22 21:12:00,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:12:00,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 21:12:00,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:12:00,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 21:12:00,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 21:12:00,863 INFO L87 Difference]: Start difference. First operand has 31 states, 25 states have (on average 1.56) internal successors, (39), 26 states have internal predecessors, (39), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-22 21:12:00,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:12:00,986 INFO L93 Difference]: Finished difference Result 54 states and 77 transitions. [2023-11-22 21:12:00,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 21:12:00,988 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2023-11-22 21:12:00,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:12:00,993 INFO L225 Difference]: With dead ends: 54 [2023-11-22 21:12:00,994 INFO L226 Difference]: Without dead ends: 24 [2023-11-22 21:12:00,997 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 21:12:01,000 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 21:12:01,004 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 54 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 21:12:01,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-11-22 21:12:01,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2023-11-22 21:12:01,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-22 21:12:01,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2023-11-22 21:12:01,029 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 18 [2023-11-22 21:12:01,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:12:01,030 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2023-11-22 21:12:01,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-22 21:12:01,031 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2023-11-22 21:12:01,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-22 21:12:01,031 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:12:01,032 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 21:12:01,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-22 21:12:01,032 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:12:01,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:12:01,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1639470509, now seen corresponding path program 1 times [2023-11-22 21:12:01,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:12:01,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299547095] [2023-11-22 21:12:01,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:12:01,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:12:01,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:12:01,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:12:01,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:12:01,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-22 21:12:01,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:12:01,218 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-22 21:12:01,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:12:01,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299547095] [2023-11-22 21:12:01,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299547095] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:12:01,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:12:01,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-22 21:12:01,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399747038] [2023-11-22 21:12:01,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:12:01,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 21:12:01,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:12:01,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 21:12:01,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-22 21:12:01,225 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-22 21:12:01,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:12:01,283 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2023-11-22 21:12:01,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-22 21:12:01,283 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2023-11-22 21:12:01,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:12:01,284 INFO L225 Difference]: With dead ends: 45 [2023-11-22 21:12:01,284 INFO L226 Difference]: Without dead ends: 29 [2023-11-22 21:12:01,287 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-22 21:12:01,288 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 4 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 21:12:01,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 58 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 21:12:01,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-11-22 21:12:01,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2023-11-22 21:12:01,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-22 21:12:01,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2023-11-22 21:12:01,298 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 18 [2023-11-22 21:12:01,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:12:01,299 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2023-11-22 21:12:01,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-22 21:12:01,299 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2023-11-22 21:12:01,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-22 21:12:01,300 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:12:01,300 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 21:12:01,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-22 21:12:01,301 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:12:01,301 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:12:01,302 INFO L85 PathProgramCache]: Analyzing trace with hash -2143999192, now seen corresponding path program 1 times [2023-11-22 21:12:01,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:12:01,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23680451] [2023-11-22 21:12:01,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:12:01,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:12:01,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:12:01,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:12:01,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:12:01,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-22 21:12:01,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:12:01,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-22 21:12:01,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:12:01,887 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-22 21:12:01,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:12:01,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23680451] [2023-11-22 21:12:01,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23680451] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 21:12:01,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [89114821] [2023-11-22 21:12:01,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:12:01,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 21:12:01,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 21:12:01,889 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) [2023-11-22 21:12:01,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-22 21:12:02,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:12:02,045 INFO L262 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 30 conjunts are in the unsatisfiable core [2023-11-22 21:12:02,051 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:12:02,190 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 8 treesize of output 4 [2023-11-22 21:12:02,221 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |node_create_~temp~0#1.base|))))) is different from true [2023-11-22 21:12:02,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 21:12:02,241 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 17 treesize of output 12 [2023-11-22 21:12:02,259 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 16 treesize of output 8 [2023-11-22 21:12:02,270 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2023-11-22 21:12:02,270 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 21:12:02,308 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_node_create_~temp~0#1.base_11| Int) (v_ArrVal_420 (Array Int Int))) (or (< |c_#StackHeapBarrier| (+ |v_node_create_~temp~0#1.base_11| 1)) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_11| v_ArrVal_420) |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0)))) is different from false [2023-11-22 21:12:02,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [89114821] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 21:12:02,310 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 21:12:02,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 19 [2023-11-22 21:12:02,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503679512] [2023-11-22 21:12:02,310 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 21:12:02,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-22 21:12:02,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:12:02,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-22 21:12:02,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=260, Unknown=2, NotChecked=66, Total=380 [2023-11-22 21:12:02,312 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand has 19 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 3 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-22 21:12:02,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:12:02,600 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2023-11-22 21:12:02,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-22 21:12:02,601 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 3 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 26 [2023-11-22 21:12:02,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:12:02,601 INFO L225 Difference]: With dead ends: 50 [2023-11-22 21:12:02,602 INFO L226 Difference]: Without dead ends: 29 [2023-11-22 21:12:02,603 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=430, Unknown=2, NotChecked=86, Total=600 [2023-11-22 21:12:02,604 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 18 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 35 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-22 21:12:02,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 180 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 217 Invalid, 0 Unknown, 35 Unchecked, 0.2s Time] [2023-11-22 21:12:02,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-11-22 21:12:02,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2023-11-22 21:12:02,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-22 21:12:02,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2023-11-22 21:12:02,612 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 26 [2023-11-22 21:12:02,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:12:02,612 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2023-11-22 21:12:02,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 3 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-22 21:12:02,613 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2023-11-22 21:12:02,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-22 21:12:02,614 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:12:02,614 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 21:12:02,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-22 21:12:02,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 21:12:02,830 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:12:02,831 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:12:02,831 INFO L85 PathProgramCache]: Analyzing trace with hash -2142152150, now seen corresponding path program 1 times [2023-11-22 21:12:02,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:12:02,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697690683] [2023-11-22 21:12:02,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:12:02,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:12:02,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:12:04,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:12:04,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:12:04,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-22 21:12:04,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:12:04,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-22 21:12:04,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:12:04,934 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-22 21:12:04,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:12:04,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697690683] [2023-11-22 21:12:04,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697690683] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 21:12:04,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [137245704] [2023-11-22 21:12:04,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:12:04,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 21:12:04,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 21:12:04,938 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) [2023-11-22 21:12:04,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-22 21:12:05,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:12:05,346 INFO L262 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 129 conjunts are in the unsatisfiable core [2023-11-22 21:12:05,352 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:12:05,389 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 [2023-11-22 21:12:05,507 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 [2023-11-22 21:12:05,588 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 [2023-11-22 21:12:05,685 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-22 21:12:05,685 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 [2023-11-22 21:12:05,771 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 [2023-11-22 21:12:05,839 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 [2023-11-22 21:12:06,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 48 [2023-11-22 21:12:06,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 21:12:06,022 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 50 treesize of output 39 [2023-11-22 21:12:06,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 26 treesize of output 15 [2023-11-22 21:12:06,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 29 [2023-11-22 21:12:06,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2023-11-22 21:12:06,120 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 21:12:06,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 35 [2023-11-22 21:12:06,124 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 7 treesize of output 3 [2023-11-22 21:12:06,130 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 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-22 21:12:06,135 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 7 treesize of output 3 [2023-11-22 21:12:06,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 21:12:06,254 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-11-22 21:12:06,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 61 [2023-11-22 21:12:06,271 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-11-22 21:12:06,272 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 28 treesize of output 30 [2023-11-22 21:12:06,280 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 20 treesize of output 15 [2023-11-22 21:12:06,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 21:12:06,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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 [2023-11-22 21:12:06,526 INFO L349 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2023-11-22 21:12:06,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 973 treesize of output 423 [2023-11-22 21:12:06,725 INFO L349 Elim1Store]: treesize reduction 341, result has 9.3 percent of original size [2023-11-22 21:12:06,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 2306 treesize of output 1360 [2023-11-22 21:12:06,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 21:12:06,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 21:12:06,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 21:12:06,824 INFO L349 Elim1Store]: treesize reduction 442, result has 7.7 percent of original size [2023-11-22 21:12:06,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 1236 treesize of output 863 [2023-11-22 21:12:06,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 21:12:06,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 21:12:06,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 21:12:06,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 21:12:06,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 21:12:06,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 21:12:06,882 INFO L349 Elim1Store]: treesize reduction 133, result has 3.6 percent of original size [2023-11-22 21:12:06,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 1676 treesize of output 1058 [2023-11-22 21:12:06,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 21:12:06,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 21:12:06,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 46 [2023-11-22 21:12:06,903 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 242 treesize of output 210 [2023-11-22 21:12:06,908 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 0 case distinctions, treesize of input 27 treesize of output 19 [2023-11-22 21:12:06,927 INFO L349 Elim1Store]: treesize reduction 126, result has 14.9 percent of original size [2023-11-22 21:12:06,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 132 treesize of output 70 [2023-11-22 21:12:06,932 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 9 [2023-11-22 21:12:06,943 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 54 [2023-11-22 21:12:06,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 26 treesize of output 15 [2023-11-22 21:12:06,975 INFO L349 Elim1Store]: treesize reduction 62, result has 1.6 percent of original size [2023-11-22 21:12:06,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 953 treesize of output 1 [2023-11-22 21:12:07,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 21:12:07,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 76 treesize of output 40 [2023-11-22 21:12:07,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 21:12:07,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-22 21:12:07,131 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 21:12:07,131 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 21:12:07,190 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_689 (Array Int Int)) (v_ArrVal_688 (Array Int Int)) (v_ArrVal_694 Int) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| Int) (v_ArrVal_692 (Array Int Int)) (v_ArrVal_690 Int) (v_ArrVal_691 (Array Int Int)) (v_ArrVal_696 (Array Int Int)) (v_ArrVal_698 (Array Int Int))) (let ((.cse9 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse10 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| .cse9) .cse10)) (.cse8 (select (select |c_#memory_$Pointer$.offset| .cse9) .cse10))) (let ((.cse4 (store (store |c_#memory_$Pointer$.base| .cse7 (store (select |c_#memory_$Pointer$.base| .cse7) .cse8 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_691))) (let ((.cse0 (store (store |c_#memory_int| .cse7 v_ArrVal_692) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_698)) (.cse3 (let ((.cse5 (store |c_#memory_$Pointer$.offset| .cse7 (store (select |c_#memory_$Pointer$.offset| .cse7) .cse8 v_ArrVal_690)))) (store .cse5 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (let ((.cse6 (store (select .cse5 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) (+ |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4) v_ArrVal_694))) (store .cse6 |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| (select (select (store .cse5 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse6) |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)))))) (.cse1 (select (select .cse4 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (or (not (= v_ArrVal_696 (let ((.cse2 (+ (select (select .cse3 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (store (select .cse0 .cse1) .cse2 (select v_ArrVal_696 .cse2))))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse0 .cse1 v_ArrVal_696) (select (select (store .cse4 .cse1 v_ArrVal_689) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select (store .cse3 .cse1 v_ArrVal_688) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))))) is different from false [2023-11-22 21:12:07,209 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_689 (Array Int Int)) (v_ArrVal_688 (Array Int Int)) (v_ArrVal_694 Int) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| Int) (v_ArrVal_692 (Array Int Int)) (v_ArrVal_690 Int) (v_ArrVal_691 (Array Int Int)) (v_ArrVal_696 (Array Int Int)) (v_ArrVal_698 (Array Int Int))) (let ((.cse9 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse10 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| .cse9) .cse10)) (.cse8 (select (select |c_#memory_$Pointer$.offset| .cse9) .cse10))) (let ((.cse2 (store (store |c_#memory_$Pointer$.base| .cse7 (store (select |c_#memory_$Pointer$.base| .cse7) .cse8 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_691))) (let ((.cse0 (store (store |c_#memory_int| .cse7 v_ArrVal_692) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_698)) (.cse1 (select (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse3 (let ((.cse5 (store |c_#memory_$Pointer$.offset| .cse7 (store (select |c_#memory_$Pointer$.offset| .cse7) .cse8 v_ArrVal_690)))) (store .cse5 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| (let ((.cse6 (store (select .cse5 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) (+ |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4) v_ArrVal_694))) (store .cse6 |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| (select (select (store .cse5 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse6) |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse0 .cse1 v_ArrVal_696) (select (select (store .cse2 .cse1 v_ArrVal_689) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select (store .cse3 .cse1 v_ArrVal_688) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (not (= v_ArrVal_696 (let ((.cse4 (+ (select (select .cse3 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (store (select .cse0 .cse1) .cse4 (select v_ArrVal_696 .cse4))))))))))) is different from false [2023-11-22 21:12:07,353 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_692 (Array Int Int)) (v_ArrVal_691 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_15| Int) (v_ArrVal_696 (Array Int Int)) (v_ArrVal_698 (Array Int Int)) (v_ArrVal_689 (Array Int Int)) (v_ArrVal_688 (Array Int Int)) (v_ArrVal_694 Int) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| Int) (v_ArrVal_690 Int) (v_ArrVal_707 (Array Int Int)) (v_ArrVal_709 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_15| v_ArrVal_707)) (.cse11 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_15| v_ArrVal_709))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse13 (+ (select (select .cse7 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse8 (select (select .cse11 .cse12) .cse13)) (.cse10 (select (select .cse7 .cse12) .cse13))) (let ((.cse2 (store (store |c_#memory_$Pointer$.base| .cse8 (store (select .cse11 .cse8) .cse10 |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_15|)) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_15| v_ArrVal_691))) (let ((.cse0 (store (store |c_#memory_int| .cse8 v_ArrVal_692) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_15| v_ArrVal_698)) (.cse1 (select (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse3 (let ((.cse9 (store (select .cse7 .cse8) .cse10 v_ArrVal_690))) (let ((.cse5 (store |c_#memory_$Pointer$.offset| .cse8 .cse9))) (store .cse5 |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_15| (let ((.cse6 (store (select (store .cse7 .cse8 .cse9) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_15|) (+ |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4) v_ArrVal_694))) (store .cse6 |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| (select (select (store .cse5 |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_15| .cse6) |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)))))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse0 .cse1 v_ArrVal_696) (select (select (store .cse2 .cse1 v_ArrVal_689) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store .cse3 .cse1 v_ArrVal_688) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))) (not (= v_ArrVal_696 (let ((.cse4 (+ (select (select .cse3 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (store (select .cse0 .cse1) .cse4 (select v_ArrVal_696 .cse4))))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_15|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_15| 1))))))))) is different from false [2023-11-22 21:12:07,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [137245704] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 21:12:07,357 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 21:12:07,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23] total 40 [2023-11-22 21:12:07,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963927028] [2023-11-22 21:12:07,358 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 21:12:07,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-11-22 21:12:07,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:12:07,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-11-22 21:12:07,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1518, Unknown=3, NotChecked=240, Total=1892 [2023-11-22 21:12:07,360 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 40 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 30 states have internal predecessors, (38), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-22 21:12:08,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:12:08,678 INFO L93 Difference]: Finished difference Result 53 states and 66 transitions. [2023-11-22 21:12:08,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-22 21:12:08,678 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 30 states have internal predecessors, (38), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 26 [2023-11-22 21:12:08,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:12:08,679 INFO L225 Difference]: With dead ends: 53 [2023-11-22 21:12:08,679 INFO L226 Difference]: Without dead ends: 51 [2023-11-22 21:12:08,680 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 848 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=289, Invalid=3260, Unknown=3, NotChecked=354, Total=3906 [2023-11-22 21:12:08,681 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 93 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-22 21:12:08,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 198 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-22 21:12:08,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-11-22 21:12:08,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 30. [2023-11-22 21:12:08,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-22 21:12:08,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2023-11-22 21:12:08,686 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 26 [2023-11-22 21:12:08,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:12:08,687 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2023-11-22 21:12:08,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 30 states have internal predecessors, (38), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-22 21:12:08,687 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2023-11-22 21:12:08,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-22 21:12:08,688 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:12:08,688 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 21:12:08,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-22 21:12:08,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-11-22 21:12:08,909 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:12:08,909 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:12:08,909 INFO L85 PathProgramCache]: Analyzing trace with hash 2125151189, now seen corresponding path program 1 times [2023-11-22 21:12:08,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:12:08,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612419115] [2023-11-22 21:12:08,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:12:08,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:12:08,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:12:10,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:12:10,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:12:10,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-22 21:12:10,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:12:10,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-22 21:12:10,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:12:10,647 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-22 21:12:10,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:12:10,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612419115] [2023-11-22 21:12:10,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612419115] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 21:12:10,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [272699869] [2023-11-22 21:12:10,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:12:10,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 21:12:10,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 21:12:10,649 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) [2023-11-22 21:12:10,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-22 21:12:11,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:12:11,142 INFO L262 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 155 conjunts are in the unsatisfiable core [2023-11-22 21:12:11,147 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:12:11,179 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 [2023-11-22 21:12:11,315 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 [2023-11-22 21:12:11,400 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-22 21:12:11,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2023-11-22 21:12:11,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 48 [2023-11-22 21:12:11,707 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 8 treesize of output 1 [2023-11-22 21:12:11,719 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 34 treesize of output 15 [2023-11-22 21:12:11,806 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-22 21:12:11,806 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 136 treesize of output 77 [2023-11-22 21:12:11,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 34 [2023-11-22 21:12:11,816 INFO L349 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2023-11-22 21:12:11,816 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 34 treesize of output 29 [2023-11-22 21:12:11,820 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 27 treesize of output 23 [2023-11-22 21:12:11,828 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 13 treesize of output 9 [2023-11-22 21:12:11,830 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 5 [2023-11-22 21:12:11,834 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 7 treesize of output 3 [2023-11-22 21:12:11,901 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 [2023-11-22 21:12:11,973 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-22 21:12:11,973 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 [2023-11-22 21:12:11,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 21:12:11,994 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-11-22 21:12:11,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 144 treesize of output 87 [2023-11-22 21:12:12,013 INFO L349 Elim1Store]: treesize reduction 25, result has 49.0 percent of original size [2023-11-22 21:12:12,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 78 treesize of output 83 [2023-11-22 21:12:12,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 53 [2023-11-22 21:12:12,028 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-11-22 21:12:12,210 INFO L349 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2023-11-22 21:12:12,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 1176 treesize of output 506 [2023-11-22 21:12:12,732 INFO L349 Elim1Store]: treesize reduction 3217, result has 3.0 percent of original size [2023-11-22 21:12:12,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 11 new quantified variables, introduced 22 case distinctions, treesize of input 3932 treesize of output 2450 [2023-11-22 21:12:12,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 21:12:12,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 21:12:12,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 21:12:12,805 INFO L349 Elim1Store]: treesize reduction 234, result has 9.3 percent of original size [2023-11-22 21:12:12,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 1764 treesize of output 775 [2023-11-22 21:12:12,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 21:12:12,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 14 [2023-11-22 21:12:12,868 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 21:12:12,946 INFO L349 Elim1Store]: treesize reduction 206, result has 22.0 percent of original size [2023-11-22 21:12:12,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 180 treesize of output 232 [2023-11-22 21:12:12,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2023-11-22 21:12:13,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 13 [2023-11-22 21:12:13,192 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-11-22 21:12:13,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-22 21:12:13,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 21:12:13,393 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: unsuccessful DER at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:170) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:122) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:543) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:522) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:515) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:326) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:298) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-11-22 21:12:13,397 INFO L158 Benchmark]: Toolchain (without parser) took 13868.55ms. Allocated memory was 188.7MB in the beginning and 490.7MB in the end (delta: 302.0MB). Free memory was 118.1MB in the beginning and 425.0MB in the end (delta: -306.8MB). Peak memory consumption was 254.9MB. Max. memory is 16.1GB. [2023-11-22 21:12:13,397 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 104.9MB. Free memory is still 68.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-22 21:12:13,397 INFO L158 Benchmark]: CACSL2BoogieTranslator took 418.29ms. Allocated memory is still 188.7MB. Free memory was 118.0MB in the beginning and 155.9MB in the end (delta: -37.9MB). Peak memory consumption was 21.1MB. Max. memory is 16.1GB. [2023-11-22 21:12:13,397 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.19ms. Allocated memory is still 188.7MB. Free memory was 155.9MB in the beginning and 153.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-22 21:12:13,397 INFO L158 Benchmark]: Boogie Preprocessor took 40.47ms. Allocated memory is still 188.7MB. Free memory was 153.9MB in the beginning and 151.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-22 21:12:13,398 INFO L158 Benchmark]: RCFGBuilder took 419.37ms. Allocated memory is still 188.7MB. Free memory was 151.8MB in the beginning and 130.8MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-22 21:12:13,398 INFO L158 Benchmark]: TraceAbstraction took 12951.21ms. Allocated memory was 188.7MB in the beginning and 490.7MB in the end (delta: 302.0MB). Free memory was 130.3MB in the beginning and 425.0MB in the end (delta: -294.7MB). Peak memory consumption was 265.3MB. Max. memory is 16.1GB. [2023-11-22 21:12:13,399 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.18ms. Allocated memory is still 104.9MB. Free memory is still 68.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 418.29ms. Allocated memory is still 188.7MB. Free memory was 118.0MB in the beginning and 155.9MB in the end (delta: -37.9MB). Peak memory consumption was 21.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.19ms. Allocated memory is still 188.7MB. Free memory was 155.9MB in the beginning and 153.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.47ms. Allocated memory is still 188.7MB. Free memory was 153.9MB in the beginning and 151.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 419.37ms. Allocated memory is still 188.7MB. Free memory was 151.8MB in the beginning and 130.8MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 12951.21ms. Allocated memory was 188.7MB in the beginning and 490.7MB in the end (delta: 302.0MB). Free memory was 130.3MB in the beginning and 425.0MB in the end (delta: -294.7MB). Peak memory consumption was 265.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: unsuccessful DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: unsuccessful DER: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:170) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-11-22 21:12:13,419 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/list-simple/dll2c_append_unequal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 9aabbeff87ba819b44dc608a3105d0ba81b71cd88693ecf2e6bf3860a7863e64 --preprocessor.use.memory.slicer false --- Real Ultimate output --- This is Ultimate 0.2.3-dev-6ae2ee4-m [2023-11-22 21:12:15,323 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-22 21:12:15,392 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-22 21:12:15,403 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-22 21:12:15,404 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-22 21:12:15,428 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-22 21:12:15,429 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-22 21:12:15,429 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-22 21:12:15,430 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-22 21:12:15,432 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-22 21:12:15,433 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-22 21:12:15,433 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-22 21:12:15,433 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-22 21:12:15,434 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-22 21:12:15,434 INFO L153 SettingsManager]: * Use SBE=true [2023-11-22 21:12:15,435 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-22 21:12:15,435 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-22 21:12:15,435 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-22 21:12:15,435 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-22 21:12:15,436 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-22 21:12:15,436 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-22 21:12:15,437 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-22 21:12:15,437 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-22 21:12:15,437 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-22 21:12:15,437 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-22 21:12:15,437 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-22 21:12:15,438 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-22 21:12:15,438 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-22 21:12:15,438 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-22 21:12:15,438 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-22 21:12:15,439 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-22 21:12:15,439 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-22 21:12:15,440 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-22 21:12:15,440 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 21:12:15,440 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-22 21:12:15,440 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-22 21:12:15,441 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-22 21:12:15,441 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-22 21:12:15,441 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-22 21:12:15,441 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-22 21:12:15,441 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-22 21:12:15,442 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-22 21:12:15,442 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-22 21:12:15,442 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-22 21:12:15,442 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-22 21:12:15,442 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 -> 9aabbeff87ba819b44dc608a3105d0ba81b71cd88693ecf2e6bf3860a7863e64 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> false [2023-11-22 21:12:15,694 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-22 21:12:15,715 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-22 21:12:15,717 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-22 21:12:15,718 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-22 21:12:15,718 INFO L274 PluginConnector]: CDTParser initialized [2023-11-22 21:12:15,721 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2c_append_unequal.i [2023-11-22 21:12:16,898 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-22 21:12:17,094 INFO L384 CDTParser]: Found 1 translation units. [2023-11-22 21:12:17,095 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_append_unequal.i [2023-11-22 21:12:17,111 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ed7913b1/81486db5584f4f7bbbe0100a707c8567/FLAG2b118836b [2023-11-22 21:12:17,125 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ed7913b1/81486db5584f4f7bbbe0100a707c8567 [2023-11-22 21:12:17,127 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-22 21:12:17,129 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-22 21:12:17,131 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-22 21:12:17,132 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-22 21:12:17,135 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-22 21:12:17,136 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:12:17" (1/1) ... [2023-11-22 21:12:17,137 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9da7085 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:12:17, skipping insertion in model container [2023-11-22 21:12:17,137 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:12:17" (1/1) ... [2023-11-22 21:12:17,183 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-22 21:12:17,489 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_append_unequal.i[24672,24685] [2023-11-22 21:12:17,494 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 21:12:17,506 INFO L202 MainTranslator]: Completed pre-run [2023-11-22 21:12:17,544 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_append_unequal.i[24672,24685] [2023-11-22 21:12:17,545 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 21:12:17,566 INFO L206 MainTranslator]: Completed translation [2023-11-22 21:12:17,567 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:12:17 WrapperNode [2023-11-22 21:12:17,567 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-22 21:12:17,568 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-22 21:12:17,568 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-22 21:12:17,568 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-22 21:12:17,573 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:12:17" (1/1) ... [2023-11-22 21:12:17,590 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:12:17" (1/1) ... [2023-11-22 21:12:17,606 INFO L138 Inliner]: procedures = 130, calls = 49, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 150 [2023-11-22 21:12:17,607 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-22 21:12:17,607 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-22 21:12:17,608 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-22 21:12:17,609 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-22 21:12:17,615 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:12:17" (1/1) ... [2023-11-22 21:12:17,616 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:12:17" (1/1) ... [2023-11-22 21:12:17,619 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:12:17" (1/1) ... [2023-11-22 21:12:17,622 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:12:17" (1/1) ... [2023-11-22 21:12:17,628 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:12:17" (1/1) ... [2023-11-22 21:12:17,642 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:12:17" (1/1) ... [2023-11-22 21:12:17,645 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:12:17" (1/1) ... [2023-11-22 21:12:17,657 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:12:17" (1/1) ... [2023-11-22 21:12:17,665 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-22 21:12:17,667 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-22 21:12:17,668 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-22 21:12:17,668 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-22 21:12:17,669 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:12:17" (1/1) ... [2023-11-22 21:12:17,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 21:12:17,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 21:12:17,697 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-22 21:12:17,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-22 21:12:17,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-11-22 21:12:17,739 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-22 21:12:17,739 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-22 21:12:17,739 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-22 21:12:17,739 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-22 21:12:17,740 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-22 21:12:17,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-22 21:12:17,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-22 21:12:17,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-22 21:12:17,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-22 21:12:17,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-22 21:12:17,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-22 21:12:17,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-22 21:12:17,741 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-22 21:12:17,870 INFO L241 CfgBuilder]: Building ICFG [2023-11-22 21:12:17,872 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-22 21:12:18,352 INFO L282 CfgBuilder]: Performing block encoding [2023-11-22 21:12:18,393 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-22 21:12:18,393 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-22 21:12:18,394 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:12:18 BoogieIcfgContainer [2023-11-22 21:12:18,394 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-22 21:12:18,396 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-22 21:12:18,396 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-22 21:12:18,399 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-22 21:12:18,399 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 09:12:17" (1/3) ... [2023-11-22 21:12:18,400 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ec559a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:12:18, skipping insertion in model container [2023-11-22 21:12:18,400 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:12:17" (2/3) ... [2023-11-22 21:12:18,402 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ec559a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:12:18, skipping insertion in model container [2023-11-22 21:12:18,402 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:12:18" (3/3) ... [2023-11-22 21:12:18,404 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_append_unequal.i [2023-11-22 21:12:18,418 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-22 21:12:18,418 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-22 21:12:18,459 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-22 21:12:18,464 INFO L357 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, mHoare=true, 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;@23a71422, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-22 21:12:18,465 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-22 21:12:18,468 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 25 states have (on average 1.56) internal successors, (39), 26 states have internal predecessors, (39), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-22 21:12:18,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-22 21:12:18,473 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:12:18,474 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 21:12:18,474 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:12:18,479 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:12:18,480 INFO L85 PathProgramCache]: Analyzing trace with hash -977421440, now seen corresponding path program 1 times [2023-11-22 21:12:18,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 21:12:18,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2070966832] [2023-11-22 21:12:18,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:12:18,490 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 21:12:18,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 21:12:18,491 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 21:12:18,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-22 21:12:18,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:12:18,652 INFO L262 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-22 21:12:18,655 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:12:18,676 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 21:12:18,677 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 21:12:18,677 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 21:12:18,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2070966832] [2023-11-22 21:12:18,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2070966832] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:12:18,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:12:18,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-22 21:12:18,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064698765] [2023-11-22 21:12:18,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:12:18,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-22 21:12:18,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 21:12:18,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-22 21:12:18,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-22 21:12:18,711 INFO L87 Difference]: Start difference. First operand has 31 states, 25 states have (on average 1.56) internal successors, (39), 26 states have internal predecessors, (39), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-22 21:12:18,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:12:18,770 INFO L93 Difference]: Finished difference Result 54 states and 77 transitions. [2023-11-22 21:12:18,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-22 21:12:18,772 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2023-11-22 21:12:18,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:12:18,777 INFO L225 Difference]: With dead ends: 54 [2023-11-22 21:12:18,777 INFO L226 Difference]: Without dead ends: 24 [2023-11-22 21:12:18,779 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-22 21:12:18,782 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 21:12:18,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 21:12:18,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-11-22 21:12:18,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2023-11-22 21:12:18,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-22 21:12:18,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2023-11-22 21:12:18,808 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 18 [2023-11-22 21:12:18,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:12:18,809 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2023-11-22 21:12:18,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-22 21:12:18,809 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2023-11-22 21:12:18,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-22 21:12:18,810 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:12:18,810 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 21:12:18,818 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-11-22 21:12:19,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 21:12:19,015 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:12:19,015 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:12:19,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1639470509, now seen corresponding path program 1 times [2023-11-22 21:12:19,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 21:12:19,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [512315071] [2023-11-22 21:12:19,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:12:19,017 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 21:12:19,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 21:12:19,018 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 21:12:19,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-22 21:12:19,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:12:19,170 INFO L262 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-22 21:12:19,171 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:12:19,210 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 21:12:19,210 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 21:12:19,210 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 21:12:19,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [512315071] [2023-11-22 21:12:19,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [512315071] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:12:19,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:12:19,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-22 21:12:19,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635363002] [2023-11-22 21:12:19,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:12:19,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 21:12:19,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 21:12:19,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 21:12:19,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 21:12:19,218 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-22 21:12:19,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:12:19,309 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2023-11-22 21:12:19,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 21:12:19,310 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2023-11-22 21:12:19,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:12:19,311 INFO L225 Difference]: With dead ends: 45 [2023-11-22 21:12:19,311 INFO L226 Difference]: Without dead ends: 29 [2023-11-22 21:12:19,311 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 21:12:19,312 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 4 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 21:12:19,312 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 47 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 21:12:19,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-11-22 21:12:19,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2023-11-22 21:12:19,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-22 21:12:19,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2023-11-22 21:12:19,316 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 18 [2023-11-22 21:12:19,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:12:19,317 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2023-11-22 21:12:19,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-22 21:12:19,317 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2023-11-22 21:12:19,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-22 21:12:19,317 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:12:19,317 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 21:12:19,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-11-22 21:12:19,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 21:12:19,521 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:12:19,521 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:12:19,521 INFO L85 PathProgramCache]: Analyzing trace with hash -2143999192, now seen corresponding path program 1 times [2023-11-22 21:12:19,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 21:12:19,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [676873828] [2023-11-22 21:12:19,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:12:19,522 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 21:12:19,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 21:12:19,524 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 21:12:19,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-22 21:12:19,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:12:19,771 INFO L262 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 21 conjunts are in the unsatisfiable core [2023-11-22 21:12:19,774 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:12:20,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 1 [2023-11-22 21:12:20,112 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 8 treesize of output 4 [2023-11-22 21:12:20,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 21:12:20,266 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 17 treesize of output 12 [2023-11-22 21:12:20,314 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 16 treesize of output 8 [2023-11-22 21:12:20,331 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-22 21:12:20,331 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 21:12:20,485 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 21:12:20,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [676873828] [2023-11-22 21:12:20,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [676873828] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 21:12:20,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [552607237] [2023-11-22 21:12:20,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:12:20,486 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-22 21:12:20,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-11-22 21:12:20,501 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-22 21:12:20,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2023-11-22 21:12:20,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:12:20,799 INFO L262 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-22 21:12:20,802 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:12:21,075 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 8 treesize of output 4 [2023-11-22 21:12:21,191 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-22 21:12:21,191 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 17 treesize of output 16 [2023-11-22 21:12:21,273 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 16 treesize of output 8 [2023-11-22 21:12:21,277 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-22 21:12:21,277 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 21:12:21,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [552607237] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 21:12:21,345 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 21:12:21,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2023-11-22 21:12:21,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164681784] [2023-11-22 21:12:21,345 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 21:12:21,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-22 21:12:21,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 21:12:21,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-22 21:12:21,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=643, Unknown=7, NotChecked=0, Total=756 [2023-11-22 21:12:21,348 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand has 26 states, 20 states have (on average 1.75) internal successors, (35), 19 states have internal predecessors, (35), 4 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-22 21:12:26,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-22 21:12:26,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:12:26,539 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2023-11-22 21:12:26,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-22 21:12:26,553 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 20 states have (on average 1.75) internal successors, (35), 19 states have internal predecessors, (35), 4 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 26 [2023-11-22 21:12:26,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:12:26,553 INFO L225 Difference]: With dead ends: 50 [2023-11-22 21:12:26,553 INFO L226 Difference]: Without dead ends: 29 [2023-11-22 21:12:26,554 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=225, Invalid=1244, Unknown=13, NotChecked=0, Total=1482 [2023-11-22 21:12:26,555 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 42 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 9 mSolverCounterUnsat, 17 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 17 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2023-11-22 21:12:26,555 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 225 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 314 Invalid, 17 Unknown, 0 Unchecked, 4.8s Time] [2023-11-22 21:12:26,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-11-22 21:12:26,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2023-11-22 21:12:26,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-22 21:12:26,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2023-11-22 21:12:26,559 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 26 [2023-11-22 21:12:26,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:12:26,559 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2023-11-22 21:12:26,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 20 states have (on average 1.75) internal successors, (35), 19 states have internal predecessors, (35), 4 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-22 21:12:26,560 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2023-11-22 21:12:26,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-22 21:12:26,564 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:12:26,564 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 21:12:26,572 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-11-22 21:12:26,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Forceful destruction successful, exit code 0 [2023-11-22 21:12:26,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-11-22 21:12:26,970 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:12:26,971 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:12:26,971 INFO L85 PathProgramCache]: Analyzing trace with hash -2142152150, now seen corresponding path program 1 times [2023-11-22 21:12:26,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 21:12:26,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1223459939] [2023-11-22 21:12:26,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:12:26,971 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 21:12:26,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 21:12:26,972 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 21:12:26,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-22 21:12:27,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:12:27,311 INFO L262 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 85 conjunts are in the unsatisfiable core [2023-11-22 21:12:27,317 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:12:27,330 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 7 [2023-11-22 21:12:27,353 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 5 [2023-11-22 21:12:27,440 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-22 21:12:27,441 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 27 [2023-11-22 21:12:27,596 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 0 case distinctions, treesize of input 15 treesize of output 11 [2023-11-22 21:12:27,661 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 [2023-11-22 21:12:27,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 21:12:27,764 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-22 21:12:27,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 39 [2023-11-22 21:12:27,883 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 [2023-11-22 21:12:28,008 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 16 treesize of output 11 [2023-11-22 21:12:28,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 48 [2023-11-22 21:12:28,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 21:12:28,327 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 50 treesize of output 39 [2023-11-22 21:12:28,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 26 treesize of output 15 [2023-11-22 21:12:28,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 29 [2023-11-22 21:12:28,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2023-11-22 21:12:28,497 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-22 21:12:28,498 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 73 treesize of output 36 [2023-11-22 21:12:28,510 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 [2023-11-22 21:12:28,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 21:12:28,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2023-11-22 21:12:28,536 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 7 treesize of output 3 [2023-11-22 21:12:28,768 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-22 21:12:28,769 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 [2023-11-22 21:12:28,779 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 [2023-11-22 21:12:28,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 21:12:28,807 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-11-22 21:12:28,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 81 treesize of output 62 [2023-11-22 21:12:28,862 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-22 21:12:28,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2023-11-22 21:12:28,909 INFO L349 Elim1Store]: treesize reduction 32, result has 43.9 percent of original size [2023-11-22 21:12:28,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 43 [2023-11-22 21:12:29,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 21:12:29,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 21:12:34,653 WARN L293 SmtUtils]: Spent 5.35s on a formula simplification. DAG size of input: 144 DAG size of output: 48 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-11-22 21:12:34,653 INFO L349 Elim1Store]: treesize reduction 570, result has 14.3 percent of original size [2023-11-22 21:12:34,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 9 new quantified variables, introduced 20 case distinctions, treesize of input 1685 treesize of output 1347 [2023-11-22 21:12:34,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 21:12:34,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 21:12:34,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 21:12:34,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 21:12:34,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 113 [2023-11-22 21:12:34,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 21:12:34,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 358 treesize of output 192 [2023-11-22 21:12:34,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 21:12:34,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 21:12:34,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 38 [2023-11-22 21:12:34,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 26 treesize of output 15 [2023-11-22 21:12:34,974 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 239 treesize of output 207 [2023-11-22 21:12:35,026 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 21:12:35,043 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 21:12:35,259 INFO L349 Elim1Store]: treesize reduction 223, result has 3.5 percent of original size [2023-11-22 21:12:35,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 429 treesize of output 335 [2023-11-22 21:12:35,328 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-11-22 21:12:35,342 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 1399 treesize of output 1183 [2023-11-22 21:12:35,351 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-11-22 21:12:35,365 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-11-22 21:12:35,405 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-11-22 21:12:35,419 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-11-22 21:12:35,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 174 treesize of output 145 [2023-11-22 21:12:35,729 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 21:12:35,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1223459939] [2023-11-22 21:12:35,730 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-11-22 21:12:35,735 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-11-22 21:12:35,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 21:12:35,931 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: no need to replace index at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructReplacementForSelectCase(DerPreprocessor.java:331) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructDerEnabler(DerPreprocessor.java:186) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:144) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:153) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:543) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:522) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:515) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:326) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:298) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-11-22 21:12:35,935 INFO L158 Benchmark]: Toolchain (without parser) took 18805.85ms. Allocated memory was 77.6MB in the beginning and 184.5MB in the end (delta: 107.0MB). Free memory was 37.8MB in the beginning and 109.3MB in the end (delta: -71.5MB). Peak memory consumption was 91.9MB. Max. memory is 16.1GB. [2023-11-22 21:12:35,935 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 77.6MB. Free memory is still 59.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-22 21:12:35,935 INFO L158 Benchmark]: CACSL2BoogieTranslator took 435.56ms. Allocated memory is still 77.6MB. Free memory was 37.5MB in the beginning and 45.9MB in the end (delta: -8.4MB). Peak memory consumption was 12.3MB. Max. memory is 16.1GB. [2023-11-22 21:12:35,935 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.43ms. Allocated memory is still 77.6MB. Free memory was 45.9MB in the beginning and 43.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-22 21:12:35,935 INFO L158 Benchmark]: Boogie Preprocessor took 59.39ms. Allocated memory is still 77.6MB. Free memory was 43.5MB in the beginning and 41.2MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-22 21:12:35,936 INFO L158 Benchmark]: RCFGBuilder took 726.85ms. Allocated memory was 77.6MB in the beginning and 142.6MB in the end (delta: 65.0MB). Free memory was 41.2MB in the beginning and 106.5MB in the end (delta: -65.3MB). Peak memory consumption was 15.2MB. Max. memory is 16.1GB. [2023-11-22 21:12:35,936 INFO L158 Benchmark]: TraceAbstraction took 17538.44ms. Allocated memory was 142.6MB in the beginning and 184.5MB in the end (delta: 41.9MB). Free memory was 105.9MB in the beginning and 109.3MB in the end (delta: -3.4MB). Peak memory consumption was 95.9MB. Max. memory is 16.1GB. [2023-11-22 21:12:35,937 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.18ms. Allocated memory is still 77.6MB. Free memory is still 59.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 435.56ms. Allocated memory is still 77.6MB. Free memory was 37.5MB in the beginning and 45.9MB in the end (delta: -8.4MB). Peak memory consumption was 12.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.43ms. Allocated memory is still 77.6MB. Free memory was 45.9MB in the beginning and 43.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.39ms. Allocated memory is still 77.6MB. Free memory was 43.5MB in the beginning and 41.2MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 726.85ms. Allocated memory was 77.6MB in the beginning and 142.6MB in the end (delta: 65.0MB). Free memory was 41.2MB in the beginning and 106.5MB in the end (delta: -65.3MB). Peak memory consumption was 15.2MB. Max. memory is 16.1GB. * TraceAbstraction took 17538.44ms. Allocated memory was 142.6MB in the beginning and 184.5MB in the end (delta: 41.9MB). Free memory was 105.9MB in the beginning and 109.3MB in the end (delta: -3.4MB). Peak memory consumption was 95.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: no need to replace index de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: no need to replace index: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructReplacementForSelectCase(DerPreprocessor.java:331) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-11-22 21:12:35,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: no need to replace index