./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_predec_08_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_predec_08_good.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 64bit --witnessprinter.graph.data.programhash 6e8bfcc3a67be4044ef797cd4040a11ac0a5b17debac9dd5344f9777da9bda4b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 23:20:47,320 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 23:20:47,387 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-10-11 23:20:47,392 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 23:20:47,393 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 23:20:47,413 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 23:20:47,417 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 23:20:47,418 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 23:20:47,418 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 23:20:47,418 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 23:20:47,419 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 23:20:47,419 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 23:20:47,419 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 23:20:47,420 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 23:20:47,420 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 23:20:47,420 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 23:20:47,420 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 23:20:47,421 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 23:20:47,421 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 23:20:47,421 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 23:20:47,421 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 23:20:47,422 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 23:20:47,422 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 23:20:47,422 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 23:20:47,423 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 23:20:47,423 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 23:20:47,423 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 23:20:47,424 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 23:20:47,424 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 23:20:47,424 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 23:20:47,424 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 23:20:47,425 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 23:20:47,425 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 23:20:47,431 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 23:20:47,431 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 23:20:47,431 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 23:20:47,431 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 23:20:47,431 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 23:20:47,432 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 23:20:47,432 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 23:20:47,432 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 23:20:47,433 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-clean/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-clean/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6e8bfcc3a67be4044ef797cd4040a11ac0a5b17debac9dd5344f9777da9bda4b [2024-10-11 23:20:47,644 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 23:20:47,665 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 23:20:47,669 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 23:20:47,670 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 23:20:47,671 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 23:20:47,672 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_predec_08_good.i [2024-10-11 23:20:48,975 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 23:20:49,248 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 23:20:49,249 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_predec_08_good.i [2024-10-11 23:20:49,271 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/8b3f89a54/63428f01bfc34782ae7213dc9e7c638e/FLAG6ccaa52fa [2024-10-11 23:20:49,547 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/8b3f89a54/63428f01bfc34782ae7213dc9e7c638e [2024-10-11 23:20:49,550 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 23:20:49,552 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 23:20:49,555 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 23:20:49,555 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 23:20:49,560 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 23:20:49,561 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:20:49" (1/1) ... [2024-10-11 23:20:49,562 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@355c7848 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:20:49, skipping insertion in model container [2024-10-11 23:20:49,563 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:20:49" (1/1) ... [2024-10-11 23:20:49,619 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 23:20:50,291 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 23:20:50,301 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 23:20:50,397 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 23:20:50,490 INFO L204 MainTranslator]: Completed translation [2024-10-11 23:20:50,490 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:20:50 WrapperNode [2024-10-11 23:20:50,491 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 23:20:50,491 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 23:20:50,492 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 23:20:50,492 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 23:20:50,497 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:20:50" (1/1) ... [2024-10-11 23:20:50,518 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:20:50" (1/1) ... [2024-10-11 23:20:50,569 INFO L138 Inliner]: procedures = 503, calls = 46, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 249 [2024-10-11 23:20:50,572 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 23:20:50,573 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 23:20:50,573 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 23:20:50,573 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 23:20:50,581 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:20:50" (1/1) ... [2024-10-11 23:20:50,581 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:20:50" (1/1) ... [2024-10-11 23:20:50,584 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:20:50" (1/1) ... [2024-10-11 23:20:50,597 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-11 23:20:50,598 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:20:50" (1/1) ... [2024-10-11 23:20:50,598 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:20:50" (1/1) ... [2024-10-11 23:20:50,603 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:20:50" (1/1) ... [2024-10-11 23:20:50,605 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:20:50" (1/1) ... [2024-10-11 23:20:50,607 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:20:50" (1/1) ... [2024-10-11 23:20:50,608 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:20:50" (1/1) ... [2024-10-11 23:20:50,610 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 23:20:50,611 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 23:20:50,611 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 23:20:50,611 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 23:20:50,612 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:20:50" (1/1) ... [2024-10-11 23:20:50,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 23:20:50,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 23:20:50,644 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 23:20:50,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 23:20:50,687 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2024-10-11 23:20:50,688 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2024-10-11 23:20:50,688 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-10-11 23:20:50,688 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-10-11 23:20:50,688 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 23:20:50,688 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 23:20:50,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 23:20:50,688 INFO L130 BoogieDeclarations]: Found specification of procedure staticReturnsTrue [2024-10-11 23:20:50,689 INFO L138 BoogieDeclarations]: Found implementation of procedure staticReturnsTrue [2024-10-11 23:20:50,689 INFO L130 BoogieDeclarations]: Found specification of procedure staticReturnsFalse [2024-10-11 23:20:50,689 INFO L138 BoogieDeclarations]: Found implementation of procedure staticReturnsFalse [2024-10-11 23:20:50,833 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 23:20:50,835 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 23:20:51,155 INFO L? ?]: Removed 100 outVars from TransFormulas that were not future-live. [2024-10-11 23:20:51,155 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 23:20:51,178 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 23:20:51,179 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 23:20:51,179 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:20:51 BoogieIcfgContainer [2024-10-11 23:20:51,179 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 23:20:51,181 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 23:20:51,181 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 23:20:51,184 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 23:20:51,184 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:20:49" (1/3) ... [2024-10-11 23:20:51,185 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37b9ae6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:20:51, skipping insertion in model container [2024-10-11 23:20:51,185 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:20:50" (2/3) ... [2024-10-11 23:20:51,185 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37b9ae6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:20:51, skipping insertion in model container [2024-10-11 23:20:51,185 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:20:51" (3/3) ... [2024-10-11 23:20:51,188 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_rand_predec_08_good.i [2024-10-11 23:20:51,203 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 23:20:51,203 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-10-11 23:20:51,268 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 23:20:51,275 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;@6f952f34, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 23:20:51,275 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-10-11 23:20:51,280 INFO L276 IsEmpty]: Start isEmpty. Operand has 122 states, 91 states have (on average 1.4945054945054945) internal successors, (136), 99 states have internal predecessors, (136), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 23:20:51,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 23:20:51,288 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:20:51,289 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:20:51,290 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 23:20:51,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:20:51,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1336767886, now seen corresponding path program 1 times [2024-10-11 23:20:51,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:20:51,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985261358] [2024-10-11 23:20:51,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:20:51,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:20:51,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:51,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:20:51,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:51,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 23:20:51,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:51,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 23:20:51,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:51,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 23:20:51,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:20:51,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985261358] [2024-10-11 23:20:51,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985261358] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:20:51,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:20:51,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 23:20:51,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22498833] [2024-10-11 23:20:51,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:20:51,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 23:20:51,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:20:51,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 23:20:51,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 23:20:51,660 INFO L87 Difference]: Start difference. First operand has 122 states, 91 states have (on average 1.4945054945054945) internal successors, (136), 99 states have internal predecessors, (136), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 23:20:51,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:20:51,722 INFO L93 Difference]: Finished difference Result 216 states and 300 transitions. [2024-10-11 23:20:51,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 23:20:51,725 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 19 [2024-10-11 23:20:51,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:20:51,731 INFO L225 Difference]: With dead ends: 216 [2024-10-11 23:20:51,731 INFO L226 Difference]: Without dead ends: 116 [2024-10-11 23:20:51,734 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-10-11 23:20:51,737 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 0 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:20:51,738 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 486 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:20:51,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-10-11 23:20:51,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-10-11 23:20:51,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 88 states have (on average 1.4772727272727273) internal successors, (130), 95 states have internal predecessors, (130), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 23:20:51,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 162 transitions. [2024-10-11 23:20:51,780 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 162 transitions. Word has length 19 [2024-10-11 23:20:51,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:20:51,782 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 162 transitions. [2024-10-11 23:20:51,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 23:20:51,782 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 162 transitions. [2024-10-11 23:20:51,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-11 23:20:51,784 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:20:51,784 INFO L215 NwaCegarLoop]: trace histogram [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-10-11 23:20:51,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 23:20:51,784 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 23:20:51,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:20:51,785 INFO L85 PathProgramCache]: Analyzing trace with hash 381343541, now seen corresponding path program 1 times [2024-10-11 23:20:51,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:20:51,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664148837] [2024-10-11 23:20:51,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:20:51,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:20:51,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:51,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:20:51,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:51,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 23:20:51,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:51,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 23:20:51,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:51,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 23:20:51,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:20:51,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664148837] [2024-10-11 23:20:51,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664148837] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:20:51,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:20:51,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 23:20:51,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859309909] [2024-10-11 23:20:51,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:20:51,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 23:20:51,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:20:51,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 23:20:51,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 23:20:51,878 INFO L87 Difference]: Start difference. First operand 116 states and 162 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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-10-11 23:20:51,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:20:51,908 INFO L93 Difference]: Finished difference Result 116 states and 162 transitions. [2024-10-11 23:20:51,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 23:20:51,908 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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 25 [2024-10-11 23:20:51,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:20:51,910 INFO L225 Difference]: With dead ends: 116 [2024-10-11 23:20:51,910 INFO L226 Difference]: Without dead ends: 115 [2024-10-11 23:20:51,910 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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-10-11 23:20:51,911 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 37 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:20:51,912 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 266 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:20:51,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-10-11 23:20:51,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-10-11 23:20:51,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 88 states have (on average 1.4659090909090908) internal successors, (129), 94 states have internal predecessors, (129), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 23:20:51,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 161 transitions. [2024-10-11 23:20:51,924 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 161 transitions. Word has length 25 [2024-10-11 23:20:51,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:20:51,924 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 161 transitions. [2024-10-11 23:20:51,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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-10-11 23:20:51,925 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 161 transitions. [2024-10-11 23:20:51,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-11 23:20:51,926 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:20:51,926 INFO L215 NwaCegarLoop]: trace histogram [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-10-11 23:20:51,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 23:20:51,927 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 23:20:51,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:20:51,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1063251968, now seen corresponding path program 1 times [2024-10-11 23:20:51,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:20:51,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361246304] [2024-10-11 23:20:51,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:20:51,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:20:51,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:52,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:20:52,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:52,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 23:20:52,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:52,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 23:20:52,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:52,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 23:20:52,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:20:52,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361246304] [2024-10-11 23:20:52,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361246304] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:20:52,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:20:52,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 23:20:52,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032280551] [2024-10-11 23:20:52,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:20:52,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 23:20:52,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:20:52,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 23:20:52,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 23:20:52,054 INFO L87 Difference]: Start difference. First operand 115 states and 161 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 23:20:52,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:20:52,086 INFO L93 Difference]: Finished difference Result 116 states and 162 transitions. [2024-10-11 23:20:52,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 23:20:52,086 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2024-10-11 23:20:52,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:20:52,088 INFO L225 Difference]: With dead ends: 116 [2024-10-11 23:20:52,090 INFO L226 Difference]: Without dead ends: 115 [2024-10-11 23:20:52,090 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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-10-11 23:20:52,091 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 38 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:20:52,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 259 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:20:52,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-10-11 23:20:52,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2024-10-11 23:20:52,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 88 states have (on average 1.4545454545454546) internal successors, (128), 93 states have internal predecessors, (128), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 23:20:52,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 160 transitions. [2024-10-11 23:20:52,109 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 160 transitions. Word has length 26 [2024-10-11 23:20:52,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:20:52,109 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 160 transitions. [2024-10-11 23:20:52,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 23:20:52,110 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 160 transitions. [2024-10-11 23:20:52,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-11 23:20:52,112 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:20:52,112 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:20:52,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 23:20:52,112 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 23:20:52,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:20:52,113 INFO L85 PathProgramCache]: Analyzing trace with hash -643721588, now seen corresponding path program 1 times [2024-10-11 23:20:52,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:20:52,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006497531] [2024-10-11 23:20:52,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:20:52,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:20:52,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:52,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:20:52,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:52,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 23:20:52,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:52,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 23:20:52,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:52,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 23:20:52,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:52,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 23:20:52,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:52,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 23:20:52,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:52,286 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-11 23:20:52,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:20:52,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006497531] [2024-10-11 23:20:52,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006497531] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:20:52,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:20:52,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 23:20:52,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439324563] [2024-10-11 23:20:52,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:20:52,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 23:20:52,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:20:52,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 23:20:52,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 23:20:52,289 INFO L87 Difference]: Start difference. First operand 114 states and 160 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 23:20:52,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:20:52,321 INFO L93 Difference]: Finished difference Result 188 states and 259 transitions. [2024-10-11 23:20:52,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 23:20:52,323 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 42 [2024-10-11 23:20:52,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:20:52,324 INFO L225 Difference]: With dead ends: 188 [2024-10-11 23:20:52,324 INFO L226 Difference]: Without dead ends: 112 [2024-10-11 23:20:52,325 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 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-10-11 23:20:52,325 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:20:52,326 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 447 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:20:52,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-11 23:20:52,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-10-11 23:20:52,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 87 states have (on average 1.4482758620689655) internal successors, (126), 92 states have internal predecessors, (126), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 23:20:52,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 156 transitions. [2024-10-11 23:20:52,339 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 156 transitions. Word has length 42 [2024-10-11 23:20:52,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:20:52,342 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 156 transitions. [2024-10-11 23:20:52,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 23:20:52,342 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 156 transitions. [2024-10-11 23:20:52,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-11 23:20:52,343 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:20:52,343 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2024-10-11 23:20:52,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 23:20:52,344 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 23:20:52,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:20:52,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1268274132, now seen corresponding path program 1 times [2024-10-11 23:20:52,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:20:52,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720051168] [2024-10-11 23:20:52,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:20:52,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:20:52,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:52,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:20:52,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:52,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 23:20:52,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:52,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 23:20:52,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:52,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 23:20:52,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:52,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 23:20:52,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:52,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 23:20:52,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:52,444 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 23:20:52,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:20:52,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720051168] [2024-10-11 23:20:52,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720051168] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 23:20:52,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005770545] [2024-10-11 23:20:52,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:20:52,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 23:20:52,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 23:20:52,449 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 23:20:52,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 23:20:52,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:52,529 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 23:20:52,535 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 23:20:52,580 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 23:20:52,580 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 23:20:52,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1005770545] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:20:52,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 23:20:52,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-10-11 23:20:52,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195617372] [2024-10-11 23:20:52,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:20:52,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 23:20:52,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:20:52,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 23:20:52,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 23:20:52,584 INFO L87 Difference]: Start difference. First operand 112 states and 156 transitions. Second operand has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 23:20:52,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:20:52,622 INFO L93 Difference]: Finished difference Result 158 states and 212 transitions. [2024-10-11 23:20:52,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 23:20:52,622 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 43 [2024-10-11 23:20:52,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:20:52,623 INFO L225 Difference]: With dead ends: 158 [2024-10-11 23:20:52,623 INFO L226 Difference]: Without dead ends: 119 [2024-10-11 23:20:52,624 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 23:20:52,624 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 37 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:20:52,625 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 253 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:20:52,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-10-11 23:20:52,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2024-10-11 23:20:52,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 91 states have (on average 1.4395604395604396) internal successors, (131), 96 states have internal predecessors, (131), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 23:20:52,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 163 transitions. [2024-10-11 23:20:52,636 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 163 transitions. Word has length 43 [2024-10-11 23:20:52,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:20:52,637 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 163 transitions. [2024-10-11 23:20:52,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 23:20:52,638 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 163 transitions. [2024-10-11 23:20:52,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-11 23:20:52,639 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:20:52,639 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2024-10-11 23:20:52,652 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 23:20:52,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 23:20:52,840 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 23:20:52,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:20:52,841 INFO L85 PathProgramCache]: Analyzing trace with hash -661792172, now seen corresponding path program 1 times [2024-10-11 23:20:52,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:20:52,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401335230] [2024-10-11 23:20:52,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:20:52,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:20:52,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:52,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:20:52,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:52,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 23:20:52,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:52,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 23:20:52,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:52,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 23:20:52,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:52,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 23:20:52,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:52,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 23:20:52,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:52,906 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 23:20:52,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:20:52,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401335230] [2024-10-11 23:20:52,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401335230] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 23:20:52,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366034048] [2024-10-11 23:20:52,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:20:52,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 23:20:52,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 23:20:52,908 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 23:20:52,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 23:20:52,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:52,978 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 23:20:52,979 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 23:20:53,005 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 23:20:53,005 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 23:20:53,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [366034048] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:20:53,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 23:20:53,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-10-11 23:20:53,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988881694] [2024-10-11 23:20:53,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:20:53,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 23:20:53,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:20:53,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 23:20:53,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 23:20:53,007 INFO L87 Difference]: Start difference. First operand 117 states and 163 transitions. Second operand has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 23:20:53,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:20:53,030 INFO L93 Difference]: Finished difference Result 120 states and 166 transitions. [2024-10-11 23:20:53,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 23:20:53,031 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 44 [2024-10-11 23:20:53,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:20:53,032 INFO L225 Difference]: With dead ends: 120 [2024-10-11 23:20:53,033 INFO L226 Difference]: Without dead ends: 119 [2024-10-11 23:20:53,033 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 23:20:53,034 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 36 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:20:53,036 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 254 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:20:53,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-10-11 23:20:53,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2024-10-11 23:20:53,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 92 states have (on average 1.434782608695652) internal successors, (132), 97 states have internal predecessors, (132), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 23:20:53,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 164 transitions. [2024-10-11 23:20:53,045 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 164 transitions. Word has length 44 [2024-10-11 23:20:53,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:20:53,046 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 164 transitions. [2024-10-11 23:20:53,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 23:20:53,046 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 164 transitions. [2024-10-11 23:20:53,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-11 23:20:53,048 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:20:53,048 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:20:53,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 23:20:53,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 23:20:53,249 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 23:20:53,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:20:53,250 INFO L85 PathProgramCache]: Analyzing trace with hash 68894543, now seen corresponding path program 1 times [2024-10-11 23:20:53,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:20:53,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667646680] [2024-10-11 23:20:53,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:20:53,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:20:53,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:53,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:20:53,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:53,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 23:20:53,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:53,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 23:20:53,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:53,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 23:20:53,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:53,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 23:20:53,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:53,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 23:20:53,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:53,315 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 23:20:53,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:20:53,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667646680] [2024-10-11 23:20:53,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667646680] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:20:53,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:20:53,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 23:20:53,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848810721] [2024-10-11 23:20:53,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:20:53,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 23:20:53,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:20:53,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 23:20:53,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 23:20:53,319 INFO L87 Difference]: Start difference. First operand 118 states and 164 transitions. Second operand has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-11 23:20:53,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:20:53,349 INFO L93 Difference]: Finished difference Result 119 states and 165 transitions. [2024-10-11 23:20:53,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 23:20:53,351 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 49 [2024-10-11 23:20:53,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:20:53,352 INFO L225 Difference]: With dead ends: 119 [2024-10-11 23:20:53,352 INFO L226 Difference]: Without dead ends: 118 [2024-10-11 23:20:53,352 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 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-10-11 23:20:53,354 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 41 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:20:53,354 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 252 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:20:53,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-10-11 23:20:53,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2024-10-11 23:20:53,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 92 states have (on average 1.423913043478261) internal successors, (131), 96 states have internal predecessors, (131), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 23:20:53,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 163 transitions. [2024-10-11 23:20:53,360 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 163 transitions. Word has length 49 [2024-10-11 23:20:53,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:20:53,361 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 163 transitions. [2024-10-11 23:20:53,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-11 23:20:53,361 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 163 transitions. [2024-10-11 23:20:53,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 23:20:53,362 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:20:53,362 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:20:53,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 23:20:53,362 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 23:20:53,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:20:53,362 INFO L85 PathProgramCache]: Analyzing trace with hash 2135731089, now seen corresponding path program 1 times [2024-10-11 23:20:53,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:20:53,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092218440] [2024-10-11 23:20:53,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:20:53,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:20:53,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:53,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:20:53,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:53,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 23:20:53,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:53,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 23:20:53,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:53,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 23:20:53,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:53,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 23:20:53,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:53,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 23:20:53,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:53,474 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 23:20:53,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:20:53,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092218440] [2024-10-11 23:20:53,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092218440] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:20:53,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:20:53,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 23:20:53,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728082856] [2024-10-11 23:20:53,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:20:53,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 23:20:53,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:20:53,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 23:20:53,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 23:20:53,477 INFO L87 Difference]: Start difference. First operand 117 states and 163 transitions. Second operand has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 23:20:53,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:20:53,497 INFO L93 Difference]: Finished difference Result 118 states and 164 transitions. [2024-10-11 23:20:53,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 23:20:53,497 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 50 [2024-10-11 23:20:53,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:20:53,498 INFO L225 Difference]: With dead ends: 118 [2024-10-11 23:20:53,498 INFO L226 Difference]: Without dead ends: 117 [2024-10-11 23:20:53,499 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 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-10-11 23:20:53,499 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 38 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:20:53,500 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 247 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:20:53,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-10-11 23:20:53,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 114. [2024-10-11 23:20:53,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 90 states have (on average 1.4222222222222223) internal successors, (128), 93 states have internal predecessors, (128), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 23:20:53,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 160 transitions. [2024-10-11 23:20:53,510 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 160 transitions. Word has length 50 [2024-10-11 23:20:53,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:20:53,511 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 160 transitions. [2024-10-11 23:20:53,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 23:20:53,511 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 160 transitions. [2024-10-11 23:20:53,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-11 23:20:53,514 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:20:53,514 INFO L215 NwaCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:20:53,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 23:20:53,515 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 23:20:53,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:20:53,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1606880243, now seen corresponding path program 1 times [2024-10-11 23:20:53,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:20:53,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229625940] [2024-10-11 23:20:53,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:20:53,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:20:53,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:53,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:20:53,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:53,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 23:20:53,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:53,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 23:20:53,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:53,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 23:20:53,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:53,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 23:20:53,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:53,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 23:20:53,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:53,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 23:20:53,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:53,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 23:20:53,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:53,616 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-11 23:20:53,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:20:53,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229625940] [2024-10-11 23:20:53,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229625940] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 23:20:53,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1640871732] [2024-10-11 23:20:53,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:20:53,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 23:20:53,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 23:20:53,621 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 23:20:53,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 23:20:53,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:53,704 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 23:20:53,706 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 23:20:53,728 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 23:20:53,728 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 23:20:53,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1640871732] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:20:53,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 23:20:53,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-10-11 23:20:53,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408408805] [2024-10-11 23:20:53,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:20:53,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 23:20:53,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:20:53,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 23:20:53,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 23:20:53,731 INFO L87 Difference]: Start difference. First operand 114 states and 160 transitions. Second operand has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 23:20:53,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:20:53,755 INFO L93 Difference]: Finished difference Result 115 states and 161 transitions. [2024-10-11 23:20:53,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 23:20:53,756 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 53 [2024-10-11 23:20:53,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:20:53,759 INFO L225 Difference]: With dead ends: 115 [2024-10-11 23:20:53,759 INFO L226 Difference]: Without dead ends: 114 [2024-10-11 23:20:53,759 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 23:20:53,760 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 5 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:20:53,760 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 280 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:20:53,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-10-11 23:20:53,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2024-10-11 23:20:53,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 90 states have (on average 1.4111111111111112) internal successors, (127), 92 states have internal predecessors, (127), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 23:20:53,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 159 transitions. [2024-10-11 23:20:53,768 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 159 transitions. Word has length 53 [2024-10-11 23:20:53,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:20:53,770 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 159 transitions. [2024-10-11 23:20:53,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 23:20:53,771 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 159 transitions. [2024-10-11 23:20:53,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-11 23:20:53,772 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:20:53,772 INFO L215 NwaCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:20:53,792 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 23:20:53,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 23:20:53,973 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 23:20:53,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:20:53,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1726320305, now seen corresponding path program 1 times [2024-10-11 23:20:53,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:20:53,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903934309] [2024-10-11 23:20:53,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:20:53,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:20:53,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:54,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:20:54,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:54,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 23:20:54,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:54,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 23:20:54,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:54,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 23:20:54,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:54,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 23:20:54,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:54,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 23:20:54,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:54,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 23:20:54,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:54,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 23:20:54,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:54,057 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-11 23:20:54,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:20:54,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903934309] [2024-10-11 23:20:54,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903934309] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 23:20:54,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [516495779] [2024-10-11 23:20:54,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:20:54,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 23:20:54,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 23:20:54,059 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 23:20:54,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 23:20:54,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:54,137 INFO L255 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 23:20:54,138 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 23:20:54,158 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 23:20:54,159 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 23:20:54,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [516495779] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:20:54,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 23:20:54,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-10-11 23:20:54,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258664722] [2024-10-11 23:20:54,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:20:54,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 23:20:54,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:20:54,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 23:20:54,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 23:20:54,161 INFO L87 Difference]: Start difference. First operand 113 states and 159 transitions. Second operand has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 23:20:54,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:20:54,179 INFO L93 Difference]: Finished difference Result 120 states and 168 transitions. [2024-10-11 23:20:54,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 23:20:54,180 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 54 [2024-10-11 23:20:54,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:20:54,181 INFO L225 Difference]: With dead ends: 120 [2024-10-11 23:20:54,181 INFO L226 Difference]: Without dead ends: 119 [2024-10-11 23:20:54,182 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 23:20:54,182 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 1 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:20:54,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 290 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:20:54,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-10-11 23:20:54,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2024-10-11 23:20:54,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 94 states have (on average 1.4042553191489362) internal successors, (132), 96 states have internal predecessors, (132), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 23:20:54,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 166 transitions. [2024-10-11 23:20:54,189 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 166 transitions. Word has length 54 [2024-10-11 23:20:54,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:20:54,191 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 166 transitions. [2024-10-11 23:20:54,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 23:20:54,191 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 166 transitions. [2024-10-11 23:20:54,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-11 23:20:54,191 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:20:54,192 INFO L215 NwaCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:20:54,206 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 23:20:54,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-11 23:20:54,393 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 23:20:54,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:20:54,394 INFO L85 PathProgramCache]: Analyzing trace with hash 315036312, now seen corresponding path program 1 times [2024-10-11 23:20:54,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:20:54,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894389121] [2024-10-11 23:20:54,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:20:54,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:20:54,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:54,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:20:54,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:54,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 23:20:54,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:54,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 23:20:54,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:54,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 23:20:54,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:54,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 23:20:54,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:54,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 23:20:54,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:54,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 23:20:54,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:54,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 23:20:54,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:54,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 23:20:54,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:54,492 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 23:20:54,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:20:54,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894389121] [2024-10-11 23:20:54,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894389121] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 23:20:54,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [273674639] [2024-10-11 23:20:54,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:20:54,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 23:20:54,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 23:20:54,494 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 23:20:54,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 23:20:54,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:54,573 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 23:20:54,575 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 23:20:54,613 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 23:20:54,613 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 23:20:54,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [273674639] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:20:54,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 23:20:54,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-10-11 23:20:54,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335584162] [2024-10-11 23:20:54,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:20:54,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 23:20:54,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:20:54,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 23:20:54,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 23:20:54,617 INFO L87 Difference]: Start difference. First operand 118 states and 166 transitions. Second operand has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-11 23:20:54,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:20:54,633 INFO L93 Difference]: Finished difference Result 119 states and 167 transitions. [2024-10-11 23:20:54,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 23:20:54,635 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 60 [2024-10-11 23:20:54,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:20:54,636 INFO L225 Difference]: With dead ends: 119 [2024-10-11 23:20:54,636 INFO L226 Difference]: Without dead ends: 118 [2024-10-11 23:20:54,637 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 23:20:54,637 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 1 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:20:54,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 280 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:20:54,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-10-11 23:20:54,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 112. [2024-10-11 23:20:54,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 90 states have (on average 1.4) internal successors, (126), 91 states have internal predecessors, (126), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 23:20:54,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 158 transitions. [2024-10-11 23:20:54,643 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 158 transitions. Word has length 60 [2024-10-11 23:20:54,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:20:54,643 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 158 transitions. [2024-10-11 23:20:54,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-11 23:20:54,643 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 158 transitions. [2024-10-11 23:20:54,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-11 23:20:54,644 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:20:54,644 INFO L215 NwaCegarLoop]: trace histogram [6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:20:54,660 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-11 23:20:54,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-11 23:20:54,845 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 23:20:54,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:20:54,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1649591134, now seen corresponding path program 1 times [2024-10-11 23:20:54,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:20:54,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470998897] [2024-10-11 23:20:54,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:20:54,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:20:54,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:54,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:20:54,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:54,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 23:20:54,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:54,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 23:20:54,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:54,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 23:20:54,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:54,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 23:20:54,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:54,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 23:20:54,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:54,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 23:20:54,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:54,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 23:20:54,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:54,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 23:20:54,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:54,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 23:20:54,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:54,924 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-10-11 23:20:54,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:20:54,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470998897] [2024-10-11 23:20:54,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470998897] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 23:20:54,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [233687260] [2024-10-11 23:20:54,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:20:54,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 23:20:54,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 23:20:54,926 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 23:20:54,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 23:20:55,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:55,002 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 23:20:55,004 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 23:20:55,021 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-11 23:20:55,022 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 23:20:55,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [233687260] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:20:55,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 23:20:55,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-10-11 23:20:55,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297831790] [2024-10-11 23:20:55,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:20:55,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 23:20:55,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:20:55,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 23:20:55,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 23:20:55,024 INFO L87 Difference]: Start difference. First operand 112 states and 158 transitions. Second operand has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-11 23:20:55,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:20:55,041 INFO L93 Difference]: Finished difference Result 112 states and 158 transitions. [2024-10-11 23:20:55,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 23:20:55,042 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 64 [2024-10-11 23:20:55,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:20:55,043 INFO L225 Difference]: With dead ends: 112 [2024-10-11 23:20:55,043 INFO L226 Difference]: Without dead ends: 111 [2024-10-11 23:20:55,043 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 23:20:55,044 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 3 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:20:55,044 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 282 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:20:55,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-10-11 23:20:55,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-10-11 23:20:55,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 90 states have (on average 1.3888888888888888) internal successors, (125), 90 states have internal predecessors, (125), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 23:20:55,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 157 transitions. [2024-10-11 23:20:55,050 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 157 transitions. Word has length 64 [2024-10-11 23:20:55,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:20:55,051 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 157 transitions. [2024-10-11 23:20:55,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-11 23:20:55,051 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 157 transitions. [2024-10-11 23:20:55,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-11 23:20:55,052 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:20:55,052 INFO L215 NwaCegarLoop]: trace histogram [6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:20:55,066 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 23:20:55,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-11 23:20:55,256 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 23:20:55,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:20:55,256 INFO L85 PathProgramCache]: Analyzing trace with hash 402282707, now seen corresponding path program 1 times [2024-10-11 23:20:55,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:20:55,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468408164] [2024-10-11 23:20:55,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:20:55,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:20:55,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:55,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:20:55,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:55,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 23:20:55,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:55,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 23:20:55,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:55,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 23:20:55,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:55,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 23:20:55,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:55,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 23:20:55,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:55,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 23:20:55,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:55,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 23:20:55,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:55,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 23:20:55,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:55,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 23:20:55,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:55,330 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-10-11 23:20:55,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:20:55,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468408164] [2024-10-11 23:20:55,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468408164] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 23:20:55,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [343704611] [2024-10-11 23:20:55,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:20:55,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 23:20:55,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 23:20:55,332 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 23:20:55,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 23:20:55,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:55,402 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 23:20:55,404 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 23:20:55,421 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-11 23:20:55,421 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 23:20:55,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [343704611] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:20:55,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 23:20:55,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-10-11 23:20:55,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244343785] [2024-10-11 23:20:55,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:20:55,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 23:20:55,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:20:55,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 23:20:55,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 23:20:55,423 INFO L87 Difference]: Start difference. First operand 111 states and 157 transitions. Second operand has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-11 23:20:55,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:20:55,438 INFO L93 Difference]: Finished difference Result 117 states and 163 transitions. [2024-10-11 23:20:55,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 23:20:55,439 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 65 [2024-10-11 23:20:55,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:20:55,440 INFO L225 Difference]: With dead ends: 117 [2024-10-11 23:20:55,440 INFO L226 Difference]: Without dead ends: 111 [2024-10-11 23:20:55,440 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 23:20:55,441 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 0 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:20:55,441 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 289 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:20:55,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-10-11 23:20:55,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-10-11 23:20:55,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 90 states have (on average 1.3777777777777778) internal successors, (124), 90 states have internal predecessors, (124), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 23:20:55,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 156 transitions. [2024-10-11 23:20:55,447 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 156 transitions. Word has length 65 [2024-10-11 23:20:55,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:20:55,448 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 156 transitions. [2024-10-11 23:20:55,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-11 23:20:55,448 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 156 transitions. [2024-10-11 23:20:55,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-11 23:20:55,451 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:20:55,451 INFO L215 NwaCegarLoop]: trace histogram [6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:20:55,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-11 23:20:55,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 23:20:55,652 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 23:20:55,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:20:55,652 INFO L85 PathProgramCache]: Analyzing trace with hash -407063919, now seen corresponding path program 1 times [2024-10-11 23:20:55,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:20:55,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462368542] [2024-10-11 23:20:55,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:20:55,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:20:55,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:55,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:20:55,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:55,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 23:20:55,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:55,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 23:20:55,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:55,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 23:20:55,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:55,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 23:20:55,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:55,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 23:20:55,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:55,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 23:20:55,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:55,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 23:20:55,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:55,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 23:20:55,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:55,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 23:20:55,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:55,737 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-10-11 23:20:55,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:20:55,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462368542] [2024-10-11 23:20:55,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462368542] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 23:20:55,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [488069745] [2024-10-11 23:20:55,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:20:55,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 23:20:55,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 23:20:55,739 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 23:20:55,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 23:20:55,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:55,809 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 23:20:55,811 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 23:20:55,830 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-11 23:20:55,830 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 23:20:55,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [488069745] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:20:55,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 23:20:55,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-10-11 23:20:55,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201683596] [2024-10-11 23:20:55,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:20:55,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 23:20:55,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:20:55,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 23:20:55,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 23:20:55,832 INFO L87 Difference]: Start difference. First operand 111 states and 156 transitions. Second operand has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-11 23:20:55,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:20:55,843 INFO L93 Difference]: Finished difference Result 111 states and 156 transitions. [2024-10-11 23:20:55,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 23:20:55,844 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 65 [2024-10-11 23:20:55,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:20:55,844 INFO L225 Difference]: With dead ends: 111 [2024-10-11 23:20:55,844 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 23:20:55,845 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 23:20:55,845 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:20:55,845 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 281 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:20:55,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 23:20:55,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 23:20:55,846 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-10-11 23:20:55,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 23:20:55,846 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 65 [2024-10-11 23:20:55,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:20:55,846 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 23:20:55,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-11 23:20:55,846 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 23:20:55,846 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 23:20:55,851 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2024-10-11 23:20:55,851 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2024-10-11 23:20:55,851 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2024-10-11 23:20:55,852 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2024-10-11 23:20:55,852 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2024-10-11 23:20:55,871 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2024-10-11 23:20:55,872 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2024-10-11 23:20:55,872 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2024-10-11 23:20:55,886 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-11 23:20:56,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-11 23:20:56,076 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:20:56,078 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 23:20:56,144 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 23:20:56,160 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 11:20:56 BoogieIcfgContainer [2024-10-11 23:20:56,160 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 23:20:56,161 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 23:20:56,161 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 23:20:56,161 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 23:20:56,162 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:20:51" (3/4) ... [2024-10-11 23:20:56,164 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 23:20:56,167 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2024-10-11 23:20:56,167 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure staticReturnsFalse [2024-10-11 23:20:56,167 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2024-10-11 23:20:56,167 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure staticReturnsTrue [2024-10-11 23:20:56,176 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2024-10-11 23:20:56,176 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2024-10-11 23:20:56,177 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 23:20:56,177 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 23:20:56,285 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 23:20:56,286 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 23:20:56,286 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 23:20:56,287 INFO L158 Benchmark]: Toolchain (without parser) took 6733.94ms. Allocated memory was 178.3MB in the beginning and 285.2MB in the end (delta: 107.0MB). Free memory was 116.9MB in the beginning and 232.8MB in the end (delta: -115.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 23:20:56,287 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 178.3MB. Free memory is still 143.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 23:20:56,287 INFO L158 Benchmark]: CACSL2BoogieTranslator took 936.19ms. Allocated memory is still 178.3MB. Free memory was 116.5MB in the beginning and 49.6MB in the end (delta: 66.8MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2024-10-11 23:20:56,288 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.88ms. Allocated memory was 178.3MB in the beginning and 237.0MB in the end (delta: 58.7MB). Free memory was 49.6MB in the beginning and 203.5MB in the end (delta: -153.9MB). Peak memory consumption was 17.6MB. Max. memory is 16.1GB. [2024-10-11 23:20:56,288 INFO L158 Benchmark]: Boogie Preprocessor took 37.55ms. Allocated memory is still 237.0MB. Free memory was 203.5MB in the beginning and 201.2MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 23:20:56,288 INFO L158 Benchmark]: RCFGBuilder took 568.39ms. Allocated memory is still 237.0MB. Free memory was 201.2MB in the beginning and 172.1MB in the end (delta: 29.2MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-10-11 23:20:56,288 INFO L158 Benchmark]: TraceAbstraction took 4979.79ms. Allocated memory was 237.0MB in the beginning and 285.2MB in the end (delta: 48.2MB). Free memory was 172.1MB in the beginning and 241.1MB in the end (delta: -69.1MB). Peak memory consumption was 106.9MB. Max. memory is 16.1GB. [2024-10-11 23:20:56,289 INFO L158 Benchmark]: Witness Printer took 124.86ms. Allocated memory is still 285.2MB. Free memory was 241.1MB in the beginning and 232.8MB in the end (delta: 8.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 23:20:56,290 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 178.3MB. Free memory is still 143.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 936.19ms. Allocated memory is still 178.3MB. Free memory was 116.5MB in the beginning and 49.6MB in the end (delta: 66.8MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 80.88ms. Allocated memory was 178.3MB in the beginning and 237.0MB in the end (delta: 58.7MB). Free memory was 49.6MB in the beginning and 203.5MB in the end (delta: -153.9MB). Peak memory consumption was 17.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.55ms. Allocated memory is still 237.0MB. Free memory was 203.5MB in the beginning and 201.2MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 568.39ms. Allocated memory is still 237.0MB. Free memory was 201.2MB in the beginning and 172.1MB in the end (delta: 29.2MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 4979.79ms. Allocated memory was 237.0MB in the beginning and 285.2MB in the end (delta: 48.2MB). Free memory was 172.1MB in the beginning and 241.1MB in the end (delta: -69.1MB). Peak memory consumption was 106.9MB. Max. memory is 16.1GB. * Witness Printer took 124.86ms. Allocated memory is still 285.2MB. Free memory was 241.1MB in the beginning and 232.8MB in the end (delta: 8.4MB). Peak memory consumption was 6.3MB. 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: 1572]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1572]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1594]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1594]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1619]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1619]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1636]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1636]: 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 5 procedures, 122 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 4.8s, OverallIterations: 14, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 246 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 237 mSDsluCounter, 4166 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2082 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 218 IncrementalHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 2084 mSDtfsCounter, 218 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 666 GetRequests, 634 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=122occurred in iteration=0, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 16 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 1107 NumberOfCodeBlocks, 1107 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1085 ConstructedInterpolants, 0 QuantifiedInterpolants, 1319 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1436 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 22 InterpolantComputations, 14 PerfectInterpolantSequences, 310/330 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 8 specifications checked. All of them hold - ProcedureContractResult [Line: 1552]: Procedure Contract for staticReturnsFalse Derived contract for procedure staticReturnsFalse. Ensures: (\result == 0) - ProcedureContractResult [Line: 1548]: Procedure Contract for staticReturnsTrue Derived contract for procedure staticReturnsTrue. Ensures: (\result == 1) RESULT: Ultimate proved your program to be correct! [2024-10-11 23:20:56,311 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE