./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/array-memsafety/add_last-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-memsafety/add_last-alloca-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-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 ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 870a7e5617be5a547f8d530603b5c27ad6cbb74bb05a83654285fee7bbb92753 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 16:41:09,172 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 16:41:09,242 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-12 16:41:09,248 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 16:41:09,248 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 16:41:09,268 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 16:41:09,269 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 16:41:09,269 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 16:41:09,270 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 16:41:09,270 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 16:41:09,270 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 16:41:09,271 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 16:41:09,271 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 16:41:09,272 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 16:41:09,272 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 16:41:09,273 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 16:41:09,273 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 16:41:09,273 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 16:41:09,274 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 16:41:09,274 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 16:41:09,275 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 16:41:09,275 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 16:41:09,275 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 16:41:09,276 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 16:41:09,276 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 16:41:09,276 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-12 16:41:09,277 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 16:41:09,277 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 16:41:09,277 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 16:41:09,278 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 16:41:09,278 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 16:41:09,278 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 16:41:09,279 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 16:41:09,279 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 16:41:09,279 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 16:41:09,280 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 16:41:09,280 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 16:41:09,280 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 16:41:09,281 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 16:41:09,281 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 16:41:09,281 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 16:41:09,282 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 16:41:09,282 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 16:41:09,282 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 16:41:09,282 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 ! overflow) ) 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 -> 870a7e5617be5a547f8d530603b5c27ad6cbb74bb05a83654285fee7bbb92753 [2024-11-12 16:41:09,524 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 16:41:09,549 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 16:41:09,552 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 16:41:09,553 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 16:41:09,554 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 16:41:09,555 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/add_last-alloca-1.i [2024-11-12 16:41:11,001 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 16:41:11,238 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 16:41:11,239 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/add_last-alloca-1.i [2024-11-12 16:41:11,254 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/355be3603/ef58349c080b42208ab8b3f0c9f140e0/FLAG795320189 [2024-11-12 16:41:11,267 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/355be3603/ef58349c080b42208ab8b3f0c9f140e0 [2024-11-12 16:41:11,270 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 16:41:11,271 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 16:41:11,274 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 16:41:11,274 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 16:41:11,279 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 16:41:11,280 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:41:11" (1/1) ... [2024-11-12 16:41:11,281 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a5e1f06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:41:11, skipping insertion in model container [2024-11-12 16:41:11,283 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:41:11" (1/1) ... [2024-11-12 16:41:11,324 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 16:41:11,638 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 16:41:11,645 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 16:41:11,684 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 16:41:11,716 INFO L204 MainTranslator]: Completed translation [2024-11-12 16:41:11,717 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:41:11 WrapperNode [2024-11-12 16:41:11,720 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 16:41:11,721 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 16:41:11,721 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 16:41:11,721 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 16:41:11,726 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:41:11" (1/1) ... [2024-11-12 16:41:11,739 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:41:11" (1/1) ... [2024-11-12 16:41:11,757 INFO L138 Inliner]: procedures = 115, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 61 [2024-11-12 16:41:11,759 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 16:41:11,759 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 16:41:11,759 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 16:41:11,759 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 16:41:11,769 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:41:11" (1/1) ... [2024-11-12 16:41:11,769 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:41:11" (1/1) ... [2024-11-12 16:41:11,772 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:41:11" (1/1) ... [2024-11-12 16:41:11,783 INFO L175 MemorySlicer]: Split 6 memory accesses to 1 slices as follows [6]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 2 writes are split as follows [2]. [2024-11-12 16:41:11,783 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:41:11" (1/1) ... [2024-11-12 16:41:11,784 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:41:11" (1/1) ... [2024-11-12 16:41:11,791 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:41:11" (1/1) ... [2024-11-12 16:41:11,796 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:41:11" (1/1) ... [2024-11-12 16:41:11,797 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:41:11" (1/1) ... [2024-11-12 16:41:11,798 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:41:11" (1/1) ... [2024-11-12 16:41:11,803 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 16:41:11,804 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 16:41:11,804 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 16:41:11,804 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 16:41:11,809 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:41:11" (1/1) ... [2024-11-12 16:41:11,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 16:41:11,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:41:11,845 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 16:41:11,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 16:41:11,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-12 16:41:11,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-12 16:41:11,933 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-12 16:41:11,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-12 16:41:11,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 16:41:11,933 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 16:41:12,018 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 16:41:12,019 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 16:41:12,113 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-12 16:41:12,113 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 16:41:12,122 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 16:41:12,123 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-12 16:41:12,123 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:41:12 BoogieIcfgContainer [2024-11-12 16:41:12,123 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 16:41:12,125 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 16:41:12,125 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 16:41:12,127 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 16:41:12,128 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 04:41:11" (1/3) ... [2024-11-12 16:41:12,128 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@279453f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:41:12, skipping insertion in model container [2024-11-12 16:41:12,128 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:41:11" (2/3) ... [2024-11-12 16:41:12,129 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@279453f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:41:12, skipping insertion in model container [2024-11-12 16:41:12,129 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:41:12" (3/3) ... [2024-11-12 16:41:12,130 INFO L112 eAbstractionObserver]: Analyzing ICFG add_last-alloca-1.i [2024-11-12 16:41:12,142 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 16:41:12,143 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-12 16:41:12,189 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 16:41:12,195 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@581da15, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 16:41:12,195 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-12 16:41:12,199 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 17 states have (on average 1.588235294117647) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:41:12,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-12 16:41:12,204 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:41:12,204 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:41:12,205 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-12 16:41:12,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:41:12,211 INFO L85 PathProgramCache]: Analyzing trace with hash 119449328, now seen corresponding path program 1 times [2024-11-12 16:41:12,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:41:12,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239553049] [2024-11-12 16:41:12,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:41:12,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:41:12,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:41:12,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:41:12,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:41:12,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239553049] [2024-11-12 16:41:12,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239553049] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:41:12,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:41:12,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 16:41:12,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099468616] [2024-11-12 16:41:12,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:41:12,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 16:41:12,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:41:12,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 16:41:12,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 16:41:12,563 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.588235294117647) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:41:12,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:41:12,623 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2024-11-12 16:41:12,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 16:41:12,627 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-12 16:41:12,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:41:12,635 INFO L225 Difference]: With dead ends: 39 [2024-11-12 16:41:12,635 INFO L226 Difference]: Without dead ends: 22 [2024-11-12 16:41:12,638 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 16:41:12,642 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 1 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 16:41:12,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 52 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 16:41:12,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-12 16:41:12,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-11-12 16:41:12,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:41:12,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2024-11-12 16:41:12,666 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 8 [2024-11-12 16:41:12,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:41:12,666 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2024-11-12 16:41:12,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:41:12,667 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2024-11-12 16:41:12,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-12 16:41:12,667 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:41:12,667 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:41:12,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 16:41:12,668 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-12 16:41:12,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:41:12,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1174908621, now seen corresponding path program 1 times [2024-11-12 16:41:12,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:41:12,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878468445] [2024-11-12 16:41:12,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:41:12,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:41:12,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:41:12,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:41:12,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:41:12,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878468445] [2024-11-12 16:41:12,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878468445] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:41:12,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:41:12,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 16:41:12,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003938163] [2024-11-12 16:41:12,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:41:12,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 16:41:12,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:41:12,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 16:41:12,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 16:41:12,788 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:41:12,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:41:12,827 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2024-11-12 16:41:12,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 16:41:12,828 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-12 16:41:12,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:41:12,829 INFO L225 Difference]: With dead ends: 29 [2024-11-12 16:41:12,829 INFO L226 Difference]: Without dead ends: 22 [2024-11-12 16:41:12,829 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 16:41:12,831 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 17 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 16:41:12,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 22 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 16:41:12,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-12 16:41:12,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-11-12 16:41:12,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 21 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:41:12,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2024-11-12 16:41:12,839 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 10 [2024-11-12 16:41:12,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:41:12,839 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2024-11-12 16:41:12,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:41:12,840 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2024-11-12 16:41:12,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-12 16:41:12,841 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:41:12,841 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:41:12,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 16:41:12,841 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-12 16:41:12,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:41:12,842 INFO L85 PathProgramCache]: Analyzing trace with hash 2024593004, now seen corresponding path program 1 times [2024-11-12 16:41:12,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:41:12,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300415896] [2024-11-12 16:41:12,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:41:12,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:41:12,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:41:13,013 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:41:13,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:41:13,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300415896] [2024-11-12 16:41:13,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300415896] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 16:41:13,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1100996656] [2024-11-12 16:41:13,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:41:13,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:41:13,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:41:13,018 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 16:41:13,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 16:41:13,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:41:13,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 16:41:13,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:41:13,224 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:41:13,225 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 16:41:13,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1100996656] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:41:13,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 16:41:13,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 10 [2024-11-12 16:41:13,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604085320] [2024-11-12 16:41:13,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:41:13,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 16:41:13,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:41:13,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 16:41:13,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-12 16:41:13,232 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:41:13,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:41:13,295 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2024-11-12 16:41:13,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 16:41:13,296 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-12 16:41:13,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:41:13,296 INFO L225 Difference]: With dead ends: 49 [2024-11-12 16:41:13,296 INFO L226 Difference]: Without dead ends: 36 [2024-11-12 16:41:13,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-12 16:41:13,298 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 8 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 16:41:13,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 38 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 16:41:13,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-12 16:41:13,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 29. [2024-11-12 16:41:13,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 25 states have (on average 1.24) internal successors, (31), 28 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:41:13,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2024-11-12 16:41:13,303 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 12 [2024-11-12 16:41:13,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:41:13,304 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2024-11-12 16:41:13,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:41:13,304 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2024-11-12 16:41:13,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-12 16:41:13,305 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:41:13,305 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:41:13,323 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-12 16:41:13,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:41:13,510 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-12 16:41:13,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:41:13,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1631565994, now seen corresponding path program 1 times [2024-11-12 16:41:13,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:41:13,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842244807] [2024-11-12 16:41:13,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:41:13,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:41:13,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:41:13,602 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:41:13,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:41:13,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842244807] [2024-11-12 16:41:13,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842244807] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 16:41:13,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1696424153] [2024-11-12 16:41:13,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:41:13,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:41:13,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:41:13,606 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 16:41:13,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-12 16:41:13,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:41:13,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 16:41:13,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:41:13,727 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:41:13,727 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 16:41:13,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1696424153] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:41:13,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 16:41:13,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-11-12 16:41:13,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949676698] [2024-11-12 16:41:13,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:41:13,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 16:41:13,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:41:13,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 16:41:13,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-12 16:41:13,729 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:41:13,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:41:13,766 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2024-11-12 16:41:13,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 16:41:13,767 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-12 16:41:13,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:41:13,767 INFO L225 Difference]: With dead ends: 29 [2024-11-12 16:41:13,768 INFO L226 Difference]: Without dead ends: 28 [2024-11-12 16:41:13,768 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-12 16:41:13,769 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 1 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 16:41:13,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 45 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 16:41:13,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-12 16:41:13,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-12 16:41:13,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 25 states have (on average 1.2) internal successors, (30), 27 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:41:13,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2024-11-12 16:41:13,774 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 12 [2024-11-12 16:41:13,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:41:13,774 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2024-11-12 16:41:13,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:41:13,775 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2024-11-12 16:41:13,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-12 16:41:13,775 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:41:13,775 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:41:13,792 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-12 16:41:13,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-12 16:41:13,980 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-12 16:41:13,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:41:13,981 INFO L85 PathProgramCache]: Analyzing trace with hash -961061680, now seen corresponding path program 1 times [2024-11-12 16:41:13,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:41:13,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921966010] [2024-11-12 16:41:13,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:41:13,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:41:13,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:41:14,072 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:41:14,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:41:14,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921966010] [2024-11-12 16:41:14,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921966010] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 16:41:14,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1949540982] [2024-11-12 16:41:14,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:41:14,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:41:14,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:41:14,076 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 16:41:14,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-12 16:41:14,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:41:14,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 16:41:14,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:41:14,160 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:41:14,160 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 16:41:14,207 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:41:14,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1949540982] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 16:41:14,207 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 16:41:14,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-11-12 16:41:14,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562512117] [2024-11-12 16:41:14,208 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 16:41:14,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 16:41:14,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:41:14,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 16:41:14,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-11-12 16:41:14,210 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:41:14,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:41:14,296 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2024-11-12 16:41:14,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 16:41:14,297 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-12 16:41:14,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:41:14,299 INFO L225 Difference]: With dead ends: 41 [2024-11-12 16:41:14,299 INFO L226 Difference]: Without dead ends: 40 [2024-11-12 16:41:14,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-11-12 16:41:14,300 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 16:41:14,301 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 16:41:14,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-12 16:41:14,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-12 16:41:14,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 39 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:41:14,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2024-11-12 16:41:14,307 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 13 [2024-11-12 16:41:14,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:41:14,307 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2024-11-12 16:41:14,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:41:14,307 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2024-11-12 16:41:14,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-12 16:41:14,308 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:41:14,308 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:41:14,325 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-12 16:41:14,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:41:14,509 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-12 16:41:14,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:41:14,509 INFO L85 PathProgramCache]: Analyzing trace with hash 12095919, now seen corresponding path program 1 times [2024-11-12 16:41:14,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:41:14,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814481396] [2024-11-12 16:41:14,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:41:14,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:41:14,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:41:14,802 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:41:14,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:41:14,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814481396] [2024-11-12 16:41:14,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814481396] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 16:41:14,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1074457459] [2024-11-12 16:41:14,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:41:14,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:41:14,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:41:14,805 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 16:41:14,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-12 16:41:14,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:41:14,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-12 16:41:14,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:41:14,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-12 16:41:14,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 16:41:14,975 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 16:41:14,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1074457459] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:41:14,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 16:41:14,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2024-11-12 16:41:14,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850046393] [2024-11-12 16:41:14,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:41:14,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 16:41:14,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:41:14,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 16:41:14,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-12 16:41:14,978 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:41:15,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:41:15,012 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2024-11-12 16:41:15,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 16:41:15,013 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-12 16:41:15,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:41:15,014 INFO L225 Difference]: With dead ends: 49 [2024-11-12 16:41:15,014 INFO L226 Difference]: Without dead ends: 33 [2024-11-12 16:41:15,015 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-12 16:41:15,015 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 2 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 16:41:15,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 39 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 16:41:15,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-12 16:41:15,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-12 16:41:15,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 32 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:41:15,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2024-11-12 16:41:15,020 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 14 [2024-11-12 16:41:15,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:41:15,020 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2024-11-12 16:41:15,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:41:15,021 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2024-11-12 16:41:15,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-12 16:41:15,021 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:41:15,021 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:41:15,036 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-12 16:41:15,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:41:15,222 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-12 16:41:15,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:41:15,223 INFO L85 PathProgramCache]: Analyzing trace with hash 270261357, now seen corresponding path program 1 times [2024-11-12 16:41:15,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:41:15,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358234596] [2024-11-12 16:41:15,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:41:15,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:41:15,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:41:15,657 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:41:15,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:41:15,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358234596] [2024-11-12 16:41:15,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358234596] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 16:41:15,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [935875411] [2024-11-12 16:41:15,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:41:15,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:41:15,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:41:15,661 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 16:41:15,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-12 16:41:15,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:41:15,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-12 16:41:15,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:41:15,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-12 16:41:15,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-12 16:41:15,887 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:41:15,887 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 16:41:16,003 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 16:41:16,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 70 [2024-11-12 16:41:16,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2024-11-12 16:41:16,052 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 16:41:16,053 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 78 treesize of output 74 [2024-11-12 16:41:16,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:41:16,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [935875411] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 16:41:16,153 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 16:41:16,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 19 [2024-11-12 16:41:16,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232996476] [2024-11-12 16:41:16,153 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 16:41:16,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-12 16:41:16,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:41:16,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-12 16:41:16,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2024-11-12 16:41:16,156 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:41:16,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:41:16,335 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2024-11-12 16:41:16,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 16:41:16,336 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-12 16:41:16,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:41:16,336 INFO L225 Difference]: With dead ends: 42 [2024-11-12 16:41:16,336 INFO L226 Difference]: Without dead ends: 33 [2024-11-12 16:41:16,337 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=380, Unknown=0, NotChecked=0, Total=506 [2024-11-12 16:41:16,338 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 30 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 16:41:16,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 49 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 16:41:16,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-12 16:41:16,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-12 16:41:16,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 30 states have (on average 1.2) internal successors, (36), 32 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:41:16,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2024-11-12 16:41:16,349 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 14 [2024-11-12 16:41:16,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:41:16,349 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2024-11-12 16:41:16,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:41:16,351 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2024-11-12 16:41:16,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-12 16:41:16,352 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:41:16,352 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:41:16,369 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-12 16:41:16,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:41:16,553 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-12 16:41:16,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:41:16,553 INFO L85 PathProgramCache]: Analyzing trace with hash 927985641, now seen corresponding path program 2 times [2024-11-12 16:41:16,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:41:16,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757364861] [2024-11-12 16:41:16,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:41:16,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:41:16,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 16:41:16,571 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 16:41:16,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 16:41:16,597 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 16:41:16,598 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 16:41:16,598 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-11-12 16:41:16,600 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-11-12 16:41:16,600 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-11-12 16:41:16,600 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-11-12 16:41:16,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 16:41:16,603 INFO L421 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2024-11-12 16:41:16,631 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 16:41:16,633 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 04:41:16 BoogieIcfgContainer [2024-11-12 16:41:16,634 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 16:41:16,635 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 16:41:16,635 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 16:41:16,635 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 16:41:16,636 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:41:12" (3/4) ... [2024-11-12 16:41:16,637 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-12 16:41:16,676 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-12 16:41:16,676 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 16:41:16,677 INFO L158 Benchmark]: Toolchain (without parser) took 5405.67ms. Allocated memory was 201.3MB in the beginning and 289.4MB in the end (delta: 88.1MB). Free memory was 130.4MB in the beginning and 162.6MB in the end (delta: -32.1MB). Peak memory consumption was 58.2MB. Max. memory is 16.1GB. [2024-11-12 16:41:16,677 INFO L158 Benchmark]: CDTParser took 1.10ms. Allocated memory is still 201.3MB. Free memory is still 158.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 16:41:16,678 INFO L158 Benchmark]: CACSL2BoogieTranslator took 446.85ms. Allocated memory is still 201.3MB. Free memory was 130.4MB in the beginning and 111.8MB in the end (delta: 18.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-12 16:41:16,678 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.55ms. Allocated memory is still 201.3MB. Free memory was 111.8MB in the beginning and 110.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 16:41:16,678 INFO L158 Benchmark]: Boogie Preprocessor took 43.68ms. Allocated memory is still 201.3MB. Free memory was 109.9MB in the beginning and 108.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 16:41:16,679 INFO L158 Benchmark]: RCFGBuilder took 319.58ms. Allocated memory is still 201.3MB. Free memory was 107.9MB in the beginning and 160.9MB in the end (delta: -53.0MB). Peak memory consumption was 5.3MB. Max. memory is 16.1GB. [2024-11-12 16:41:16,679 INFO L158 Benchmark]: TraceAbstraction took 4509.43ms. Allocated memory was 201.3MB in the beginning and 289.4MB in the end (delta: 88.1MB). Free memory was 159.9MB in the beginning and 164.7MB in the end (delta: -4.8MB). Peak memory consumption was 86.4MB. Max. memory is 16.1GB. [2024-11-12 16:41:16,679 INFO L158 Benchmark]: Witness Printer took 41.68ms. Allocated memory is still 289.4MB. Free memory was 164.7MB in the beginning and 162.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 16:41:16,681 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.10ms. Allocated memory is still 201.3MB. Free memory is still 158.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 446.85ms. Allocated memory is still 201.3MB. Free memory was 130.4MB in the beginning and 111.8MB in the end (delta: 18.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.55ms. Allocated memory is still 201.3MB. Free memory was 111.8MB in the beginning and 110.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.68ms. Allocated memory is still 201.3MB. Free memory was 109.9MB in the beginning and 108.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 319.58ms. Allocated memory is still 201.3MB. Free memory was 107.9MB in the beginning and 160.9MB in the end (delta: -53.0MB). Peak memory consumption was 5.3MB. Max. memory is 16.1GB. * TraceAbstraction took 4509.43ms. Allocated memory was 201.3MB in the beginning and 289.4MB in the end (delta: 88.1MB). Free memory was 159.9MB in the beginning and 164.7MB in the end (delta: -4.8MB). Peak memory consumption was 86.4MB. Max. memory is 16.1GB. * Witness Printer took 41.68ms. Allocated memory is still 289.4MB. Free memory was 164.7MB in the beginning and 162.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 526]: integer overflow possible integer overflow possible We found a FailurePath: [L513] int i, j; [L514] int length = __VERIFIER_nondet_int(); [L515] COND FALSE !(length < 1 || length >= 2147483647 / sizeof(int)) VAL [length=2] [L516] int *arr = __builtin_alloca (length*sizeof(int)); VAL [arr={2:0}, length=2] [L517] COND FALSE !(!arr) [L518] int *a = arr; [L520] int k = 0; VAL [a={2:0}, arr={2:0}, k=0, length=2] [L520] COND TRUE k < length [L522] arr[k] = __VERIFIER_nondet_int() [L520] k++ VAL [a={2:0}, arr={2:0}, k=1, length=2] [L520] COND TRUE k < length [L522] arr[k] = __VERIFIER_nondet_int() [L520] k++ VAL [a={2:0}, arr={2:0}, k=2, length=2] [L520] COND FALSE !(k < length) VAL [a={2:0}, arr={2:0}, length=2] [L525] EXPR \read(*a) [L525] EXPR arr + length - 1 [L525] COND TRUE *a != *(arr + length - 1) [L526] EXPR \read(*a) [L526] EXPR arr + length - 1 [L526] *a += *(arr + length - 1) VAL [a={2:0}, arr={2:0}, length=2] - UnprovableResult [Line: 520]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 520]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 526]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 22 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 4.4s, OverallIterations: 8, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 59 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 59 mSDsluCounter, 316 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 219 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 294 IncrementalHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 97 mSDtfsCounter, 294 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 129 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=5, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 7 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 166 NumberOfCodeBlocks, 166 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 161 ConstructedInterpolants, 0 QuantifiedInterpolants, 938 SizeOfPredicates, 16 NumberOfNonLiveVariables, 282 ConjunctsInSsa, 45 ConjunctsInUnsatCore, 14 InterpolantComputations, 5 PerfectInterpolantSequences, 7/29 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-12 16:41:16,707 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)