./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/array-tiling/pnr3.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-tiling/pnr3.c -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 e32269e91be552d606173d0b8eafd4ffa81c0e735dd375e4417d1ccfc27eaf5e --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 11:03:43,270 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 11:03:43,376 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-09 11:03:43,379 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 11:03:43,384 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 11:03:43,425 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 11:03:43,426 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 11:03:43,426 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 11:03:43,426 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 11:03:43,428 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 11:03:43,428 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 11:03:43,428 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 11:03:43,428 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 11:03:43,429 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 11:03:43,438 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 11:03:43,438 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 11:03:43,438 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 11:03:43,438 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 11:03:43,439 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 11:03:43,439 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 11:03:43,439 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 11:03:43,440 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 11:03:43,440 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 11:03:43,440 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 11:03:43,440 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 11:03:43,441 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-09 11:03:43,441 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 11:03:43,441 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 11:03:43,441 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 11:03:43,442 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 11:03:43,442 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 11:03:43,442 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 11:03:43,443 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 11:03:43,443 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 11:03:43,443 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 11:03:43,443 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 11:03:43,443 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 11:03:43,444 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 11:03:43,444 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 11:03:43,444 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 11:03:43,444 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 11:03:43,445 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 11:03:43,445 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 11:03:43,445 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 11:03:43,445 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 -> e32269e91be552d606173d0b8eafd4ffa81c0e735dd375e4417d1ccfc27eaf5e [2024-11-09 11:03:43,643 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 11:03:43,665 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 11:03:43,667 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 11:03:43,668 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 11:03:43,669 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 11:03:43,669 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-tiling/pnr3.c [2024-11-09 11:03:45,161 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 11:03:45,364 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 11:03:45,364 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/pnr3.c [2024-11-09 11:03:45,372 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0562cbdd1/9a59fb964f1f407ebb39e081696a094e/FLAGd083ae605 [2024-11-09 11:03:45,383 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0562cbdd1/9a59fb964f1f407ebb39e081696a094e [2024-11-09 11:03:45,385 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 11:03:45,386 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 11:03:45,387 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 11:03:45,387 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 11:03:45,392 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 11:03:45,392 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:03:45" (1/1) ... [2024-11-09 11:03:45,393 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37cd25cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:03:45, skipping insertion in model container [2024-11-09 11:03:45,393 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:03:45" (1/1) ... [2024-11-09 11:03:45,411 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 11:03:45,576 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 11:03:45,588 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 11:03:45,605 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 11:03:45,618 INFO L204 MainTranslator]: Completed translation [2024-11-09 11:03:45,619 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:03:45 WrapperNode [2024-11-09 11:03:45,619 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 11:03:45,620 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 11:03:45,620 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 11:03:45,620 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 11:03:45,625 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:03:45" (1/1) ... [2024-11-09 11:03:45,629 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:03:45" (1/1) ... [2024-11-09 11:03:45,657 INFO L138 Inliner]: procedures = 17, calls = 28, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 116 [2024-11-09 11:03:45,657 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 11:03:45,658 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 11:03:45,658 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 11:03:45,658 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 11:03:45,673 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:03:45" (1/1) ... [2024-11-09 11:03:45,673 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:03:45" (1/1) ... [2024-11-09 11:03:45,675 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:03:45" (1/1) ... [2024-11-09 11:03:45,687 INFO L175 MemorySlicer]: Split 16 memory accesses to 3 slices as follows [2, 7, 7]. 44 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7, 0]. The 6 writes are split as follows [0, 0, 6]. [2024-11-09 11:03:45,688 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:03:45" (1/1) ... [2024-11-09 11:03:45,688 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:03:45" (1/1) ... [2024-11-09 11:03:45,693 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:03:45" (1/1) ... [2024-11-09 11:03:45,696 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:03:45" (1/1) ... [2024-11-09 11:03:45,697 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:03:45" (1/1) ... [2024-11-09 11:03:45,697 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:03:45" (1/1) ... [2024-11-09 11:03:45,699 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 11:03:45,700 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 11:03:45,700 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 11:03:45,700 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 11:03:45,701 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:03:45" (1/1) ... [2024-11-09 11:03:45,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 11:03:45,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:03:45,730 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 11:03:45,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 11:03:45,772 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 11:03:45,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 11:03:45,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 11:03:45,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 11:03:45,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 11:03:45,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 11:03:45,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 11:03:45,773 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 11:03:45,773 INFO L130 BoogieDeclarations]: Found specification of procedure ReadFromPort [2024-11-09 11:03:45,774 INFO L138 BoogieDeclarations]: Found implementation of procedure ReadFromPort [2024-11-09 11:03:45,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 11:03:45,774 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 11:03:45,774 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 11:03:45,774 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 11:03:45,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 11:03:45,843 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 11:03:45,845 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 11:03:46,054 INFO L? ?]: Removed 47 outVars from TransFormulas that were not future-live. [2024-11-09 11:03:46,055 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 11:03:46,065 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 11:03:46,066 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-09 11:03:46,066 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:03:46 BoogieIcfgContainer [2024-11-09 11:03:46,066 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 11:03:46,068 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 11:03:46,068 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 11:03:46,070 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 11:03:46,070 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 11:03:45" (1/3) ... [2024-11-09 11:03:46,071 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eca1dfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:03:46, skipping insertion in model container [2024-11-09 11:03:46,071 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:03:45" (2/3) ... [2024-11-09 11:03:46,071 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eca1dfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:03:46, skipping insertion in model container [2024-11-09 11:03:46,072 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:03:46" (3/3) ... [2024-11-09 11:03:46,073 INFO L112 eAbstractionObserver]: Analyzing ICFG pnr3.c [2024-11-09 11:03:46,085 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 11:03:46,085 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2024-11-09 11:03:46,131 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 11:03:46,139 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;@6a8226f7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 11:03:46,140 INFO L334 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2024-11-09 11:03:46,144 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 57 states have (on average 1.719298245614035) internal successors, (98), 87 states have internal predecessors, (98), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 11:03:46,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 11:03:46,149 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:03:46,150 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:03:46,151 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2024-11-09 11:03:46,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:03:46,155 INFO L85 PathProgramCache]: Analyzing trace with hash -655793907, now seen corresponding path program 1 times [2024-11-09 11:03:46,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:03:46,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192702807] [2024-11-09 11:03:46,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:03:46,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:03:46,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:46,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:03:46,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:03:46,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192702807] [2024-11-09 11:03:46,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192702807] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:03:46,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:03:46,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:03:46,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441533914] [2024-11-09 11:03:46,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:03:46,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:03:46,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:03:46,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:03:46,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:03:46,570 INFO L87 Difference]: Start difference. First operand has 92 states, 57 states have (on average 1.719298245614035) internal successors, (98), 87 states have internal predecessors, (98), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:03:46,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:03:46,642 INFO L93 Difference]: Finished difference Result 184 states and 204 transitions. [2024-11-09 11:03:46,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:03:46,647 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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 7 [2024-11-09 11:03:46,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:03:46,653 INFO L225 Difference]: With dead ends: 184 [2024-11-09 11:03:46,672 INFO L226 Difference]: Without dead ends: 84 [2024-11-09 11:03:46,675 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-09 11:03:46,678 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 175 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:03:46,678 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 97 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:03:46,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-09 11:03:46,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-09 11:03:46,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 51 states have (on average 1.6470588235294117) internal successors, (84), 79 states have internal predecessors, (84), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 11:03:46,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2024-11-09 11:03:46,747 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 7 [2024-11-09 11:03:46,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:03:46,749 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2024-11-09 11:03:46,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:03:46,749 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2024-11-09 11:03:46,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 11:03:46,749 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:03:46,750 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:03:46,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 11:03:46,751 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2024-11-09 11:03:46,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:03:46,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1145225419, now seen corresponding path program 1 times [2024-11-09 11:03:46,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:03:46,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636738930] [2024-11-09 11:03:46,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:03:46,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:03:46,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:46,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:03:46,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:03:46,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636738930] [2024-11-09 11:03:46,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636738930] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:03:46,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:03:46,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 11:03:46,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349091666] [2024-11-09 11:03:46,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:03:46,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 11:03:46,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:03:46,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 11:03:46,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 11:03:46,892 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 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-09 11:03:46,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:03:46,975 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2024-11-09 11:03:46,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 11:03:46,975 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 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-09 11:03:46,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:03:46,976 INFO L225 Difference]: With dead ends: 84 [2024-11-09 11:03:46,977 INFO L226 Difference]: Without dead ends: 83 [2024-11-09 11:03:46,977 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-09 11:03:46,978 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 238 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:03:46,978 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 82 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:03:46,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-09 11:03:46,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-09 11:03:46,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 51 states have (on average 1.6274509803921569) internal successors, (83), 78 states have internal predecessors, (83), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 11:03:46,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2024-11-09 11:03:46,985 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 8 [2024-11-09 11:03:46,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:03:46,985 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2024-11-09 11:03:46,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 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-09 11:03:46,985 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2024-11-09 11:03:46,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 11:03:46,986 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:03:46,986 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:03:46,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 11:03:46,986 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2024-11-09 11:03:46,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:03:46,987 INFO L85 PathProgramCache]: Analyzing trace with hash 983573084, now seen corresponding path program 1 times [2024-11-09 11:03:46,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:03:46,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377791730] [2024-11-09 11:03:46,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:03:46,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:03:47,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:47,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:03:47,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:03:47,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377791730] [2024-11-09 11:03:47,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377791730] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:03:47,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:03:47,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:03:47,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963338731] [2024-11-09 11:03:47,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:03:47,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:03:47,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:03:47,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:03:47,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:03:47,073 INFO L87 Difference]: Start difference. First operand 83 states and 89 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:03:47,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:03:47,165 INFO L93 Difference]: Finished difference Result 91 states and 97 transitions. [2024-11-09 11:03:47,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:03:47,166 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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 15 [2024-11-09 11:03:47,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:03:47,167 INFO L225 Difference]: With dead ends: 91 [2024-11-09 11:03:47,167 INFO L226 Difference]: Without dead ends: 89 [2024-11-09 11:03:47,169 INFO L431 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-09 11:03:47,170 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 1 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:03:47,170 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 196 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:03:47,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-09 11:03:47,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-09 11:03:47,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 57 states have (on average 1.5614035087719298) internal successors, (89), 84 states have internal predecessors, (89), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 11:03:47,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 95 transitions. [2024-11-09 11:03:47,183 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 95 transitions. Word has length 15 [2024-11-09 11:03:47,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:03:47,183 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 95 transitions. [2024-11-09 11:03:47,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:03:47,183 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 95 transitions. [2024-11-09 11:03:47,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 11:03:47,184 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:03:47,184 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:03:47,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 11:03:47,184 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2024-11-09 11:03:47,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:03:47,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1163728849, now seen corresponding path program 1 times [2024-11-09 11:03:47,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:03:47,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060175642] [2024-11-09 11:03:47,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:03:47,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:03:47,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:47,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 11:03:47,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:47,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:03:47,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:03:47,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060175642] [2024-11-09 11:03:47,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060175642] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:03:47,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:03:47,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 11:03:47,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845877237] [2024-11-09 11:03:47,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:03:47,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 11:03:47,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:03:47,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 11:03:47,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:03:47,232 INFO L87 Difference]: Start difference. First operand 89 states and 95 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 11:03:47,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:03:47,345 INFO L93 Difference]: Finished difference Result 150 states and 163 transitions. [2024-11-09 11:03:47,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 11:03:47,346 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-11-09 11:03:47,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:03:47,348 INFO L225 Difference]: With dead ends: 150 [2024-11-09 11:03:47,349 INFO L226 Difference]: Without dead ends: 126 [2024-11-09 11:03:47,349 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:03:47,350 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 31 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:03:47,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 92 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:03:47,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-09 11:03:47,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2024-11-09 11:03:47,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 90 states have (on average 1.4) internal successors, (126), 117 states have internal predecessors, (126), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 11:03:47,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 138 transitions. [2024-11-09 11:03:47,359 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 138 transitions. Word has length 16 [2024-11-09 11:03:47,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:03:47,360 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 138 transitions. [2024-11-09 11:03:47,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 11:03:47,361 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 138 transitions. [2024-11-09 11:03:47,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 11:03:47,361 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:03:47,361 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:03:47,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 11:03:47,362 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2024-11-09 11:03:47,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:03:47,362 INFO L85 PathProgramCache]: Analyzing trace with hash 2126625391, now seen corresponding path program 1 times [2024-11-09 11:03:47,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:03:47,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456302220] [2024-11-09 11:03:47,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:03:47,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:03:47,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:47,578 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 11:03:47,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:03:47,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456302220] [2024-11-09 11:03:47,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456302220] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:03:47,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:03:47,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 11:03:47,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118330587] [2024-11-09 11:03:47,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:03:47,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:03:47,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:03:47,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:03:47,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:03:47,582 INFO L87 Difference]: Start difference. First operand 125 states and 138 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:03:47,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:03:47,715 INFO L93 Difference]: Finished difference Result 141 states and 154 transitions. [2024-11-09 11:03:47,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 11:03:47,716 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-09 11:03:47,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:03:47,717 INFO L225 Difference]: With dead ends: 141 [2024-11-09 11:03:47,717 INFO L226 Difference]: Without dead ends: 126 [2024-11-09 11:03:47,717 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:03:47,718 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 155 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:03:47,718 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 75 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:03:47,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-09 11:03:47,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2024-11-09 11:03:47,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 90 states have (on average 1.3888888888888888) internal successors, (125), 117 states have internal predecessors, (125), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 11:03:47,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 137 transitions. [2024-11-09 11:03:47,729 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 137 transitions. Word has length 21 [2024-11-09 11:03:47,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:03:47,729 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 137 transitions. [2024-11-09 11:03:47,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:03:47,729 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 137 transitions. [2024-11-09 11:03:47,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-09 11:03:47,730 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:03:47,730 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:03:47,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 11:03:47,731 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2024-11-09 11:03:47,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:03:47,731 INFO L85 PathProgramCache]: Analyzing trace with hash 285560467, now seen corresponding path program 1 times [2024-11-09 11:03:47,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:03:47,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859643512] [2024-11-09 11:03:47,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:03:47,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:03:47,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:47,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 11:03:47,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:47,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 11:03:47,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:47,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 11:03:47,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:47,867 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 11:03:47,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:03:47,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859643512] [2024-11-09 11:03:47,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859643512] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:03:47,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:03:47,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:03:47,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95009842] [2024-11-09 11:03:47,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:03:47,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:03:47,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:03:47,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:03:47,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:03:47,869 INFO L87 Difference]: Start difference. First operand 125 states and 137 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 11:03:47,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:03:47,960 INFO L93 Difference]: Finished difference Result 130 states and 142 transitions. [2024-11-09 11:03:47,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:03:47,961 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 41 [2024-11-09 11:03:47,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:03:47,962 INFO L225 Difference]: With dead ends: 130 [2024-11-09 11:03:47,962 INFO L226 Difference]: Without dead ends: 128 [2024-11-09 11:03:47,962 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 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-09 11:03:47,963 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 16 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:03:47,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 148 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:03:47,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-09 11:03:47,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2024-11-09 11:03:47,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 93 states have (on average 1.3763440860215055) internal successors, (128), 120 states have internal predecessors, (128), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 11:03:47,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 140 transitions. [2024-11-09 11:03:47,971 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 140 transitions. Word has length 41 [2024-11-09 11:03:47,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:03:47,971 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 140 transitions. [2024-11-09 11:03:47,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 11:03:47,972 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 140 transitions. [2024-11-09 11:03:47,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-09 11:03:47,973 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:03:47,973 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:03:47,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 11:03:47,973 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2024-11-09 11:03:47,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:03:47,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1104841405, now seen corresponding path program 1 times [2024-11-09 11:03:47,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:03:47,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723916490] [2024-11-09 11:03:47,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:03:47,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:03:47,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:48,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 11:03:48,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:48,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 11:03:48,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:48,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 11:03:48,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:48,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-09 11:03:48,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:48,064 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-09 11:03:48,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:03:48,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723916490] [2024-11-09 11:03:48,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723916490] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:03:48,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1783435909] [2024-11-09 11:03:48,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:03:48,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:03:48,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:03:48,067 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:03:48,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 11:03:48,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:48,128 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 11:03:48,132 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:03:48,241 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-09 11:03:48,241 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:03:48,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1783435909] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:03:48,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 11:03:48,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-11-09 11:03:48,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518176113] [2024-11-09 11:03:48,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:03:48,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:03:48,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:03:48,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:03:48,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-09 11:03:48,243 INFO L87 Difference]: Start difference. First operand 128 states and 140 transitions. Second operand has 5 states, 4 states have (on average 9.5) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 11:03:48,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:03:48,404 INFO L93 Difference]: Finished difference Result 128 states and 140 transitions. [2024-11-09 11:03:48,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 11:03:48,404 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.5) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 52 [2024-11-09 11:03:48,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:03:48,405 INFO L225 Difference]: With dead ends: 128 [2024-11-09 11:03:48,405 INFO L226 Difference]: Without dead ends: 115 [2024-11-09 11:03:48,405 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-09 11:03:48,406 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 46 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 11:03:48,406 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 144 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 11:03:48,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-09 11:03:48,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-11-09 11:03:48,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 93 states have (on average 1.2365591397849462) internal successors, (115), 107 states have internal predecessors, (115), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 11:03:48,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 127 transitions. [2024-11-09 11:03:48,420 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 127 transitions. Word has length 52 [2024-11-09 11:03:48,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:03:48,420 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 127 transitions. [2024-11-09 11:03:48,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.5) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 11:03:48,421 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 127 transitions. [2024-11-09 11:03:48,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-09 11:03:48,423 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:03:48,424 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:03:48,439 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 11:03:48,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:03:48,625 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2024-11-09 11:03:48,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:03:48,625 INFO L85 PathProgramCache]: Analyzing trace with hash -109654743, now seen corresponding path program 1 times [2024-11-09 11:03:48,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:03:48,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194788240] [2024-11-09 11:03:48,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:03:48,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:03:48,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:48,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 11:03:48,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:48,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 11:03:48,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:48,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 11:03:48,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:48,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-09 11:03:48,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:48,793 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-09 11:03:48,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:03:48,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194788240] [2024-11-09 11:03:48,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194788240] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:03:48,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [921846094] [2024-11-09 11:03:48,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:03:48,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:03:48,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:03:48,796 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:03:48,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 11:03:48,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:48,851 INFO L255 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 11:03:48,853 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:03:48,913 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-09 11:03:48,913 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:03:48,993 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-09 11:03:48,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [921846094] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:03:48,994 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:03:48,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2024-11-09 11:03:48,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371363071] [2024-11-09 11:03:48,994 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:03:48,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 11:03:48,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:03:48,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 11:03:48,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-09 11:03:48,995 INFO L87 Difference]: Start difference. First operand 115 states and 127 transitions. Second operand has 10 states, 9 states have (on average 10.666666666666666) internal successors, (96), 10 states have internal predecessors, (96), 5 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2024-11-09 11:03:49,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:03:49,152 INFO L93 Difference]: Finished difference Result 167 states and 201 transitions. [2024-11-09 11:03:49,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 11:03:49,153 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 10.666666666666666) internal successors, (96), 10 states have internal predecessors, (96), 5 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 53 [2024-11-09 11:03:49,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:03:49,154 INFO L225 Difference]: With dead ends: 167 [2024-11-09 11:03:49,154 INFO L226 Difference]: Without dead ends: 154 [2024-11-09 11:03:49,154 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-09 11:03:49,155 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 96 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:03:49,156 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 182 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:03:49,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-09 11:03:49,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2024-11-09 11:03:49,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 138 states have (on average 1.1304347826086956) internal successors, (156), 142 states have internal predecessors, (156), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-09 11:03:49,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 176 transitions. [2024-11-09 11:03:49,169 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 176 transitions. Word has length 53 [2024-11-09 11:03:49,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:03:49,170 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 176 transitions. [2024-11-09 11:03:49,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 10.666666666666666) internal successors, (96), 10 states have internal predecessors, (96), 5 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2024-11-09 11:03:49,170 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 176 transitions. [2024-11-09 11:03:49,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-09 11:03:49,171 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:03:49,171 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:03:49,188 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-09 11:03:49,371 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,SelfDestructingSolverStorable7 [2024-11-09 11:03:49,372 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2024-11-09 11:03:49,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:03:49,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1162838177, now seen corresponding path program 1 times [2024-11-09 11:03:49,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:03:49,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739915264] [2024-11-09 11:03:49,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:03:49,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:03:49,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:49,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 11:03:49,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:49,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 11:03:49,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:49,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 11:03:49,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:49,474 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 11:03:49,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:03:49,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739915264] [2024-11-09 11:03:49,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739915264] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:03:49,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [846848458] [2024-11-09 11:03:49,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:03:49,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:03:49,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:03:49,476 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:03:49,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 11:03:49,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:49,531 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 11:03:49,533 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:03:49,563 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 11:03:49,563 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:03:49,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [846848458] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:03:49,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 11:03:49,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-11-09 11:03:49,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927140821] [2024-11-09 11:03:49,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:03:49,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 11:03:49,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:03:49,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 11:03:49,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-09 11:03:49,565 INFO L87 Difference]: Start difference. First operand 154 states and 176 transitions. Second operand has 6 states, 5 states have (on average 9.0) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 11:03:49,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:03:49,653 INFO L93 Difference]: Finished difference Result 154 states and 176 transitions. [2024-11-09 11:03:49,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 11:03:49,653 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.0) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 57 [2024-11-09 11:03:49,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:03:49,654 INFO L225 Difference]: With dead ends: 154 [2024-11-09 11:03:49,654 INFO L226 Difference]: Without dead ends: 153 [2024-11-09 11:03:49,654 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 61 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-09 11:03:49,655 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 37 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:03:49,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 121 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:03:49,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-09 11:03:49,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2024-11-09 11:03:49,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 138 states have (on average 1.1231884057971016) internal successors, (155), 141 states have internal predecessors, (155), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-09 11:03:49,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 175 transitions. [2024-11-09 11:03:49,661 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 175 transitions. Word has length 57 [2024-11-09 11:03:49,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:03:49,662 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 175 transitions. [2024-11-09 11:03:49,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.0) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 11:03:49,662 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 175 transitions. [2024-11-09 11:03:49,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-09 11:03:49,663 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:03:49,663 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:03:49,677 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 11:03:49,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:03:49,864 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2024-11-09 11:03:49,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:03:49,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1688245286, now seen corresponding path program 1 times [2024-11-09 11:03:49,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:03:49,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465933708] [2024-11-09 11:03:49,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:03:49,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:03:49,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:49,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 11:03:49,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:49,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 11:03:49,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:49,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 11:03:49,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:49,935 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 11:03:49,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:03:49,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465933708] [2024-11-09 11:03:49,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465933708] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:03:49,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2010692807] [2024-11-09 11:03:49,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:03:49,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:03:49,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:03:49,937 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:03:49,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 11:03:49,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:49,994 INFO L255 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 11:03:49,995 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:03:50,021 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 11:03:50,021 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:03:50,073 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 11:03:50,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2010692807] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:03:50,074 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:03:50,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-11-09 11:03:50,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261819548] [2024-11-09 11:03:50,074 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:03:50,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 11:03:50,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:03:50,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 11:03:50,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-11-09 11:03:50,075 INFO L87 Difference]: Start difference. First operand 153 states and 175 transitions. Second operand has 12 states, 11 states have (on average 6.0) internal successors, (66), 12 states have internal predecessors, (66), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 11:03:50,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:03:50,403 INFO L93 Difference]: Finished difference Result 172 states and 196 transitions. [2024-11-09 11:03:50,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 11:03:50,403 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.0) internal successors, (66), 12 states have internal predecessors, (66), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 58 [2024-11-09 11:03:50,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:03:50,404 INFO L225 Difference]: With dead ends: 172 [2024-11-09 11:03:50,404 INFO L226 Difference]: Without dead ends: 171 [2024-11-09 11:03:50,404 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-11-09 11:03:50,405 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 88 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 11:03:50,405 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 237 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 11:03:50,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-09 11:03:50,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2024-11-09 11:03:50,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 156 states have (on average 1.108974358974359) internal successors, (173), 159 states have internal predecessors, (173), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-09 11:03:50,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 193 transitions. [2024-11-09 11:03:50,420 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 193 transitions. Word has length 58 [2024-11-09 11:03:50,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:03:50,420 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 193 transitions. [2024-11-09 11:03:50,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.0) internal successors, (66), 12 states have internal predecessors, (66), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 11:03:50,421 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 193 transitions. [2024-11-09 11:03:50,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-09 11:03:50,421 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:03:50,421 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:03:50,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-09 11:03:50,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:03:50,622 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2024-11-09 11:03:50,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:03:50,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1887348467, now seen corresponding path program 2 times [2024-11-09 11:03:50,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:03:50,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814481396] [2024-11-09 11:03:50,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:03:50,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:03:50,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:51,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 11:03:51,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:51,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 11:03:51,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:51,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 11:03:51,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:51,592 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 41 proven. 22 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 11:03:51,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:03:51,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814481396] [2024-11-09 11:03:51,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814481396] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:03:51,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1163366453] [2024-11-09 11:03:51,593 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 11:03:51,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:03:51,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:03:51,598 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:03:51,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 11:03:51,651 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-09 11:03:51,651 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 11:03:51,652 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 11:03:51,653 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:03:51,757 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-11-09 11:03:51,757 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:03:51,852 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-11-09 11:03:51,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1163366453] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:03:51,852 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:03:51,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 4, 4] total 20 [2024-11-09 11:03:51,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679368181] [2024-11-09 11:03:51,853 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:03:51,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-09 11:03:51,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:03:51,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-09 11:03:51,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2024-11-09 11:03:51,854 INFO L87 Difference]: Start difference. First operand 171 states and 193 transitions. Second operand has 20 states, 20 states have (on average 5.55) internal successors, (111), 20 states have internal predecessors, (111), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-09 11:03:52,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:03:52,400 INFO L93 Difference]: Finished difference Result 202 states and 225 transitions. [2024-11-09 11:03:52,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-09 11:03:52,400 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.55) internal successors, (111), 20 states have internal predecessors, (111), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 76 [2024-11-09 11:03:52,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:03:52,401 INFO L225 Difference]: With dead ends: 202 [2024-11-09 11:03:52,401 INFO L226 Difference]: Without dead ends: 139 [2024-11-09 11:03:52,402 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 154 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=242, Invalid=1018, Unknown=0, NotChecked=0, Total=1260 [2024-11-09 11:03:52,402 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 427 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 11:03:52,402 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 259 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 682 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 11:03:52,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-09 11:03:52,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2024-11-09 11:03:52,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 125 states have (on average 1.104) internal successors, (138), 127 states have internal predecessors, (138), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-09 11:03:52,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 158 transitions. [2024-11-09 11:03:52,407 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 158 transitions. Word has length 76 [2024-11-09 11:03:52,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:03:52,407 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 158 transitions. [2024-11-09 11:03:52,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.55) internal successors, (111), 20 states have internal predecessors, (111), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-09 11:03:52,407 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 158 transitions. [2024-11-09 11:03:52,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-09 11:03:52,408 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:03:52,408 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:03:52,422 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-09 11:03:52,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-09 11:03:52,609 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2024-11-09 11:03:52,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:03:52,610 INFO L85 PathProgramCache]: Analyzing trace with hash 602959731, now seen corresponding path program 1 times [2024-11-09 11:03:52,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:03:52,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083482984] [2024-11-09 11:03:52,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:03:52,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:03:52,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:52,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 11:03:52,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:52,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 11:03:52,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:52,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 11:03:52,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:52,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-09 11:03:52,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:52,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-09 11:03:52,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:52,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 11:03:52,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:52,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-09 11:03:52,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:52,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-09 11:03:52,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:52,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 11:03:52,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:52,680 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2024-11-09 11:03:52,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:03:52,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083482984] [2024-11-09 11:03:52,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083482984] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:03:52,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:03:52,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:03:52,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280618797] [2024-11-09 11:03:52,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:03:52,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:03:52,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:03:52,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:03:52,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:03:52,682 INFO L87 Difference]: Start difference. First operand 139 states and 158 transitions. Second operand has 4 states, 3 states have (on average 16.666666666666668) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-09 11:03:52,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:03:52,718 INFO L93 Difference]: Finished difference Result 139 states and 158 transitions. [2024-11-09 11:03:52,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:03:52,718 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 16.666666666666668) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 114 [2024-11-09 11:03:52,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:03:52,719 INFO L225 Difference]: With dead ends: 139 [2024-11-09 11:03:52,719 INFO L226 Difference]: Without dead ends: 138 [2024-11-09 11:03:52,719 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 19 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-09 11:03:52,720 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 21 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:03:52,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 67 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:03:52,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-09 11:03:52,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2024-11-09 11:03:52,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 125 states have (on average 1.096) internal successors, (137), 126 states have internal predecessors, (137), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-09 11:03:52,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 157 transitions. [2024-11-09 11:03:52,724 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 157 transitions. Word has length 114 [2024-11-09 11:03:52,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:03:52,724 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 157 transitions. [2024-11-09 11:03:52,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 16.666666666666668) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-09 11:03:52,725 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 157 transitions. [2024-11-09 11:03:52,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-09 11:03:52,725 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:03:52,725 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:03:52,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 11:03:52,726 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2024-11-09 11:03:52,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:03:52,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1031268211, now seen corresponding path program 2 times [2024-11-09 11:03:52,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:03:52,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712415444] [2024-11-09 11:03:52,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:03:52,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:03:52,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:52,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 11:03:52,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:52,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 11:03:52,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:52,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 11:03:52,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:52,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-09 11:03:52,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:52,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-09 11:03:52,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:52,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 11:03:52,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:52,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-09 11:03:52,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:52,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-09 11:03:52,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:52,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 11:03:52,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:52,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-09 11:03:52,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:52,952 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2024-11-09 11:03:52,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:03:52,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712415444] [2024-11-09 11:03:52,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712415444] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:03:52,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1794909760] [2024-11-09 11:03:52,953 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 11:03:52,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:03:52,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:03:52,954 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:03:52,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 11:03:53,014 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-09 11:03:53,014 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 11:03:53,015 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 11:03:53,017 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:03:53,300 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2024-11-09 11:03:53,301 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:03:53,459 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2024-11-09 11:03:53,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1794909760] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:03:53,459 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:03:53,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 3] total 11 [2024-11-09 11:03:53,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946718400] [2024-11-09 11:03:53,459 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:03:53,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 11:03:53,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:03:53,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 11:03:53,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-11-09 11:03:53,461 INFO L87 Difference]: Start difference. First operand 138 states and 157 transitions. Second operand has 12 states, 11 states have (on average 9.727272727272727) internal successors, (107), 12 states have internal predecessors, (107), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2024-11-09 11:03:53,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:03:53,552 INFO L93 Difference]: Finished difference Result 138 states and 157 transitions. [2024-11-09 11:03:53,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 11:03:53,552 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 9.727272727272727) internal successors, (107), 12 states have internal predecessors, (107), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 125 [2024-11-09 11:03:53,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:03:53,553 INFO L225 Difference]: With dead ends: 138 [2024-11-09 11:03:53,553 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 11:03:53,553 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2024-11-09 11:03:53,554 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 169 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:03:53,554 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 36 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:03:53,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 11:03:53,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 11:03:53,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:03:53,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 11:03:53,554 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 125 [2024-11-09 11:03:53,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:03:53,554 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 11:03:53,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 9.727272727272727) internal successors, (107), 12 states have internal predecessors, (107), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2024-11-09 11:03:53,554 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 11:03:53,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 11:03:53,557 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 30 remaining) [2024-11-09 11:03:53,557 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 30 remaining) [2024-11-09 11:03:53,557 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 30 remaining) [2024-11-09 11:03:53,557 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 30 remaining) [2024-11-09 11:03:53,557 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 30 remaining) [2024-11-09 11:03:53,557 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 30 remaining) [2024-11-09 11:03:53,558 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 30 remaining) [2024-11-09 11:03:53,558 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 30 remaining) [2024-11-09 11:03:53,558 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 30 remaining) [2024-11-09 11:03:53,558 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 30 remaining) [2024-11-09 11:03:53,558 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 30 remaining) [2024-11-09 11:03:53,558 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 30 remaining) [2024-11-09 11:03:53,558 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 30 remaining) [2024-11-09 11:03:53,558 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 30 remaining) [2024-11-09 11:03:53,558 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 30 remaining) [2024-11-09 11:03:53,558 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 30 remaining) [2024-11-09 11:03:53,559 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 30 remaining) [2024-11-09 11:03:53,559 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 30 remaining) [2024-11-09 11:03:53,559 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 30 remaining) [2024-11-09 11:03:53,559 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 30 remaining) [2024-11-09 11:03:53,559 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 30 remaining) [2024-11-09 11:03:53,559 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 30 remaining) [2024-11-09 11:03:53,559 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 30 remaining) [2024-11-09 11:03:53,559 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 30 remaining) [2024-11-09 11:03:53,559 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 30 remaining) [2024-11-09 11:03:53,559 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 30 remaining) [2024-11-09 11:03:53,560 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 30 remaining) [2024-11-09 11:03:53,560 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 30 remaining) [2024-11-09 11:03:53,560 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 30 remaining) [2024-11-09 11:03:53,560 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 30 remaining) [2024-11-09 11:03:53,573 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-09 11:03:53,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:03:53,767 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:03:53,769 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-09 11:03:54,009 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 11:03:54,024 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 11:03:54 BoogieIcfgContainer [2024-11-09 11:03:54,024 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 11:03:54,025 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 11:03:54,025 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 11:03:54,025 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 11:03:54,025 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:03:46" (3/4) ... [2024-11-09 11:03:54,027 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-09 11:03:54,029 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ReadFromPort [2024-11-09 11:03:54,033 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2024-11-09 11:03:54,033 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-09 11:03:54,033 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-09 11:03:54,033 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 11:03:54,033 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 11:03:54,104 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 11:03:54,104 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 11:03:54,104 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 11:03:54,105 INFO L158 Benchmark]: Toolchain (without parser) took 8718.79ms. Allocated memory was 180.4MB in the beginning and 274.7MB in the end (delta: 94.4MB). Free memory was 150.6MB in the beginning and 91.0MB in the end (delta: 59.7MB). Peak memory consumption was 153.7MB. Max. memory is 16.1GB. [2024-11-09 11:03:54,105 INFO L158 Benchmark]: CDTParser took 1.23ms. Allocated memory is still 125.8MB. Free memory is still 90.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 11:03:54,105 INFO L158 Benchmark]: CACSL2BoogieTranslator took 232.18ms. Allocated memory is still 180.4MB. Free memory was 150.4MB in the beginning and 140.8MB in the end (delta: 9.6MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. [2024-11-09 11:03:54,105 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.89ms. Allocated memory is still 180.4MB. Free memory was 140.8MB in the beginning and 138.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 11:03:54,105 INFO L158 Benchmark]: Boogie Preprocessor took 41.05ms. Allocated memory is still 180.4MB. Free memory was 138.8MB in the beginning and 136.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 11:03:54,105 INFO L158 Benchmark]: RCFGBuilder took 366.76ms. Allocated memory is still 180.4MB. Free memory was 136.7MB in the beginning and 118.6MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-09 11:03:54,106 INFO L158 Benchmark]: TraceAbstraction took 7956.59ms. Allocated memory was 180.4MB in the beginning and 274.7MB in the end (delta: 94.4MB). Free memory was 117.8MB in the beginning and 96.2MB in the end (delta: 21.6MB). Peak memory consumption was 115.7MB. Max. memory is 16.1GB. [2024-11-09 11:03:54,106 INFO L158 Benchmark]: Witness Printer took 79.63ms. Allocated memory is still 274.7MB. Free memory was 96.2MB in the beginning and 91.0MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 11:03:54,107 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.23ms. Allocated memory is still 125.8MB. Free memory is still 90.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 232.18ms. Allocated memory is still 180.4MB. Free memory was 150.4MB in the beginning and 140.8MB in the end (delta: 9.6MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.89ms. Allocated memory is still 180.4MB. Free memory was 140.8MB in the beginning and 138.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.05ms. Allocated memory is still 180.4MB. Free memory was 138.8MB in the beginning and 136.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 366.76ms. Allocated memory is still 180.4MB. Free memory was 136.7MB in the beginning and 118.6MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 7956.59ms. Allocated memory was 180.4MB in the beginning and 274.7MB in the end (delta: 94.4MB). Free memory was 117.8MB in the beginning and 96.2MB in the end (delta: 21.6MB). Peak memory consumption was 115.7MB. Max. memory is 16.1GB. * Witness Printer took 79.63ms. Allocated memory is still 274.7MB. Free memory was 96.2MB in the beginning and 91.0MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 61]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 61]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 61]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 61]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 65]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 65]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 65]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 65]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 69]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 69]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 92 locations, 30 error locations. Started 1 CEGAR loops. OverallTime: 7.7s, OverallIterations: 13, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1520 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1500 mSDsluCounter, 1736 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1069 mSDsCounter, 178 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2032 IncrementalHoareTripleChecker+Invalid, 2210 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 178 mSolverCounterUnsat, 667 mSDtfsCounter, 2032 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 894 GetRequests, 795 SyntacticMatches, 2 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=171occurred in iteration=10, InterpolantAutomatonStates: 86, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 1064 NumberOfCodeBlocks, 896 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1353 ConstructedInterpolants, 0 QuantifiedInterpolants, 4651 SizeOfPredicates, 4 NumberOfNonLiveVariables, 866 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 23 InterpolantComputations, 9 PerfectInterpolantSequences, 1158/1355 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 - AllSpecificationsHoldResult: All specifications hold 30 specifications checked. All of them hold - InvariantResult [Line: 69]: Loop Invariant Derived loop invariant: ((((((1 <= i) && (2 <= SIZE)) && (((SIZE >= 0) ? (SIZE % 3) : ((SIZE % 3) + 3)) == 0)) && (SIZE <= 99999)) && (MAX <= 100000)) || (((((i == 0) && (2 <= SIZE)) && (((SIZE >= 0) ? (SIZE % 3) : ((SIZE % 3) + 3)) == 0)) && (SIZE <= 99999)) && (MAX <= 100000))) - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: null - ProcedureContractResult [Line: 12]: Procedure Contract for ReadFromPort Derived contract for procedure ReadFromPort. Requires: ((((2 <= SIZE) && (((SIZE >= 0) ? (SIZE % 3) : ((SIZE % 3) + 3)) == 0)) && (SIZE <= 99999)) && (MAX <= 100000)) Ensures: (((((2 <= SIZE) && (((SIZE >= 0) ? (SIZE % 3) : ((SIZE % 3) + 3)) == 0)) && (SIZE <= 99999)) && (MAX <= 100000)) && ((SIZE == \old(SIZE)) && (MAX == \old(MAX)))) RESULT: Ultimate proved your program to be correct! [2024-11-09 11:03:54,126 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE