./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/CWE190_Integer_Overflow__int_max_multiply_11_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_max_multiply_11_good.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash f4cf3a327636065138b3aff68780319b351c24e3903e09b53dc2ed95cf03db38 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 15:10:46,343 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 15:10:46,413 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-10-13 15:10:46,418 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 15:10:46,419 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 15:10:46,439 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 15:10:46,440 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 15:10:46,440 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 15:10:46,441 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 15:10:46,442 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 15:10:46,442 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 15:10:46,442 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 15:10:46,442 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 15:10:46,442 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 15:10:46,443 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 15:10:46,443 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 15:10:46,443 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 15:10:46,443 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 15:10:46,443 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 15:10:46,444 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 15:10:46,444 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 15:10:46,446 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 15:10:46,446 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 15:10:46,447 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-13 15:10:46,447 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 15:10:46,447 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 15:10:46,447 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 15:10:46,447 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 15:10:46,447 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 15:10:46,448 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 15:10:46,448 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 15:10:46,448 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 15:10:46,448 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 15:10:46,448 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 15:10:46,448 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 15:10:46,449 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 15:10:46,449 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 15:10:46,449 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 15:10:46,449 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 15:10:46,449 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 15:10:46,449 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 15:10:46,451 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f4cf3a327636065138b3aff68780319b351c24e3903e09b53dc2ed95cf03db38 [2024-10-13 15:10:46,641 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 15:10:46,660 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 15:10:46,662 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 15:10:46,663 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 15:10:46,664 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 15:10:46,664 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_max_multiply_11_good.i [2024-10-13 15:10:47,875 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 15:10:48,149 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 15:10:48,149 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_max_multiply_11_good.i [2024-10-13 15:10:48,169 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f92c83dab/2acd8aea309046cfb9dd157c88704bfd/FLAGa963a17a6 [2024-10-13 15:10:48,432 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f92c83dab/2acd8aea309046cfb9dd157c88704bfd [2024-10-13 15:10:48,434 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 15:10:48,434 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 15:10:48,435 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 15:10:48,435 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 15:10:48,439 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 15:10:48,440 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:10:48" (1/1) ... [2024-10-13 15:10:48,440 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10bbbf95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:10:48, skipping insertion in model container [2024-10-13 15:10:48,440 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:10:48" (1/1) ... [2024-10-13 15:10:48,482 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 15:10:49,064 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 15:10:49,073 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 15:10:49,123 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 15:10:49,201 INFO L204 MainTranslator]: Completed translation [2024-10-13 15:10:49,201 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:10:49 WrapperNode [2024-10-13 15:10:49,201 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 15:10:49,202 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 15:10:49,202 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 15:10:49,202 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 15:10:49,208 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:10:49" (1/1) ... [2024-10-13 15:10:49,236 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:10:49" (1/1) ... [2024-10-13 15:10:49,260 INFO L138 Inliner]: procedures = 501, calls = 46, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 125 [2024-10-13 15:10:49,261 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 15:10:49,261 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 15:10:49,261 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 15:10:49,262 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 15:10:49,270 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:10:49" (1/1) ... [2024-10-13 15:10:49,270 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:10:49" (1/1) ... [2024-10-13 15:10:49,272 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:10:49" (1/1) ... [2024-10-13 15:10:49,280 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-13 15:10:49,280 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:10:49" (1/1) ... [2024-10-13 15:10:49,281 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:10:49" (1/1) ... [2024-10-13 15:10:49,284 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:10:49" (1/1) ... [2024-10-13 15:10:49,285 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:10:49" (1/1) ... [2024-10-13 15:10:49,286 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:10:49" (1/1) ... [2024-10-13 15:10:49,287 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:10:49" (1/1) ... [2024-10-13 15:10:49,289 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 15:10:49,290 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 15:10:49,290 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 15:10:49,290 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 15:10:49,290 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:10:49" (1/1) ... [2024-10-13 15:10:49,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 15:10:49,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 15:10:49,318 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 15:10:49,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 15:10:49,354 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2024-10-13 15:10:49,355 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2024-10-13 15:10:49,355 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-10-13 15:10:49,355 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-10-13 15:10:49,355 INFO L130 BoogieDeclarations]: Found specification of procedure globalReturnsTrue [2024-10-13 15:10:49,355 INFO L138 BoogieDeclarations]: Found implementation of procedure globalReturnsTrue [2024-10-13 15:10:49,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 15:10:49,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 15:10:49,355 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 15:10:49,355 INFO L130 BoogieDeclarations]: Found specification of procedure globalReturnsFalse [2024-10-13 15:10:49,355 INFO L138 BoogieDeclarations]: Found implementation of procedure globalReturnsFalse [2024-10-13 15:10:49,477 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 15:10:49,480 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 15:10:49,650 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2024-10-13 15:10:49,651 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 15:10:49,681 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 15:10:49,681 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-13 15:10:49,681 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:10:49 BoogieIcfgContainer [2024-10-13 15:10:49,681 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 15:10:49,683 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 15:10:49,683 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 15:10:49,687 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 15:10:49,687 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 03:10:48" (1/3) ... [2024-10-13 15:10:49,687 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@895fee4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:10:49, skipping insertion in model container [2024-10-13 15:10:49,687 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:10:49" (2/3) ... [2024-10-13 15:10:49,688 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@895fee4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:10:49, skipping insertion in model container [2024-10-13 15:10:49,688 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:10:49" (3/3) ... [2024-10-13 15:10:49,689 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_max_multiply_11_good.i [2024-10-13 15:10:49,702 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 15:10:49,702 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-10-13 15:10:49,751 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 15:10:49,756 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;@66e7d9eb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 15:10:49,757 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-10-13 15:10:49,763 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 51 states have (on average 1.4509803921568627) internal successors, (74), 59 states have internal predecessors, (74), 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-13 15:10:49,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-13 15:10:49,769 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 15:10:49,769 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] [2024-10-13 15:10:49,770 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-13 15:10:49,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 15:10:49,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1194795619, now seen corresponding path program 1 times [2024-10-13 15:10:49,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 15:10:49,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334352002] [2024-10-13 15:10:49,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 15:10:49,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 15:10:49,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:49,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 15:10:49,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:50,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 15:10:50,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:50,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 15:10:50,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:50,023 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-13 15:10:50,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 15:10:50,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334352002] [2024-10-13 15:10:50,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334352002] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 15:10:50,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 15:10:50,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 15:10:50,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956437721] [2024-10-13 15:10:50,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 15:10:50,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 15:10:50,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 15:10:50,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 15:10:50,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 15:10:50,049 INFO L87 Difference]: Start difference. First operand has 82 states, 51 states have (on average 1.4509803921568627) internal successors, (74), 59 states have internal predecessors, (74), 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 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-13 15:10:50,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 15:10:50,119 INFO L93 Difference]: Finished difference Result 157 states and 209 transitions. [2024-10-13 15:10:50,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 15:10:50,121 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (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 20 [2024-10-13 15:10:50,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 15:10:50,127 INFO L225 Difference]: With dead ends: 157 [2024-10-13 15:10:50,127 INFO L226 Difference]: Without dead ends: 84 [2024-10-13 15:10:50,130 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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-13 15:10:50,134 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 2 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 15:10:50,135 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 196 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 15:10:50,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-13 15:10:50,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2024-10-13 15:10:50,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 59 states have internal predecessors, (73), 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-13 15:10:50,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 107 transitions. [2024-10-13 15:10:50,166 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 107 transitions. Word has length 20 [2024-10-13 15:10:50,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 15:10:50,167 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 107 transitions. [2024-10-13 15:10:50,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (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-13 15:10:50,167 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 107 transitions. [2024-10-13 15:10:50,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-13 15:10:50,168 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 15:10:50,168 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] [2024-10-13 15:10:50,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 15:10:50,168 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-13 15:10:50,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 15:10:50,169 INFO L85 PathProgramCache]: Analyzing trace with hash -514737249, now seen corresponding path program 1 times [2024-10-13 15:10:50,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 15:10:50,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935900019] [2024-10-13 15:10:50,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 15:10:50,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 15:10:50,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:50,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 15:10:50,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:50,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 15:10:50,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:50,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 15:10:50,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:50,287 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-13 15:10:50,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 15:10:50,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935900019] [2024-10-13 15:10:50,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935900019] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 15:10:50,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 15:10:50,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 15:10:50,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990789534] [2024-10-13 15:10:50,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 15:10:50,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 15:10:50,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 15:10:50,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 15:10:50,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 15:10:50,292 INFO L87 Difference]: Start difference. First operand 81 states and 107 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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-13 15:10:50,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 15:10:50,319 INFO L93 Difference]: Finished difference Result 140 states and 182 transitions. [2024-10-13 15:10:50,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 15:10:50,319 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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 20 [2024-10-13 15:10:50,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 15:10:50,320 INFO L225 Difference]: With dead ends: 140 [2024-10-13 15:10:50,320 INFO L226 Difference]: Without dead ends: 70 [2024-10-13 15:10:50,321 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-13 15:10:50,321 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 0 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 249 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-13 15:10:50,322 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 249 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 15:10:50,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-10-13 15:10:50,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-10-13 15:10:50,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 50 states have internal predecessors, (60), 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-13 15:10:50,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 90 transitions. [2024-10-13 15:10:50,328 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 90 transitions. Word has length 20 [2024-10-13 15:10:50,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 15:10:50,328 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 90 transitions. [2024-10-13 15:10:50,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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-13 15:10:50,329 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 90 transitions. [2024-10-13 15:10:50,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-13 15:10:50,329 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 15:10:50,330 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] [2024-10-13 15:10:50,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 15:10:50,330 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 15:10:50,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 15:10:50,330 INFO L85 PathProgramCache]: Analyzing trace with hash 86647173, now seen corresponding path program 1 times [2024-10-13 15:10:50,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 15:10:50,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405536564] [2024-10-13 15:10:50,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 15:10:50,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 15:10:50,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:50,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 15:10:50,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:50,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 15:10:50,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:50,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 15:10:50,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:50,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 15:10:50,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:50,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 15:10:50,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:50,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 15:10:50,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:50,456 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-13 15:10:50,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 15:10:50,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405536564] [2024-10-13 15:10:50,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405536564] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 15:10:50,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 15:10:50,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 15:10:50,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736577610] [2024-10-13 15:10:50,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 15:10:50,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 15:10:50,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 15:10:50,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 15:10:50,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 15:10:50,461 INFO L87 Difference]: Start difference. First operand 70 states and 90 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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-13 15:10:50,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 15:10:50,504 INFO L93 Difference]: Finished difference Result 125 states and 159 transitions. [2024-10-13 15:10:50,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 15:10:50,505 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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 37 [2024-10-13 15:10:50,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 15:10:50,506 INFO L225 Difference]: With dead ends: 125 [2024-10-13 15:10:50,506 INFO L226 Difference]: Without dead ends: 68 [2024-10-13 15:10:50,506 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-13 15:10:50,507 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 0 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 237 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-13 15:10:50,509 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 237 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 15:10:50,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-13 15:10:50,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-10-13 15:10:50,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 44 states have (on average 1.3181818181818181) internal successors, (58), 49 states have internal predecessors, (58), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-13 15:10:50,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 86 transitions. [2024-10-13 15:10:50,519 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 86 transitions. Word has length 37 [2024-10-13 15:10:50,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 15:10:50,519 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 86 transitions. [2024-10-13 15:10:50,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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-13 15:10:50,521 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 86 transitions. [2024-10-13 15:10:50,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-13 15:10:50,521 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 15:10:50,522 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] [2024-10-13 15:10:50,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 15:10:50,522 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-13 15:10:50,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 15:10:50,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1737566178, now seen corresponding path program 1 times [2024-10-13 15:10:50,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 15:10:50,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550379372] [2024-10-13 15:10:50,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 15:10:50,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 15:10:50,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:50,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 15:10:50,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:50,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 15:10:50,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:50,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 15:10:50,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:50,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 15:10:50,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:50,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 15:10:50,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:50,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 15:10:50,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:50,587 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-13 15:10:50,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 15:10:50,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550379372] [2024-10-13 15:10:50,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550379372] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 15:10:50,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 15:10:50,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 15:10:50,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979308942] [2024-10-13 15:10:50,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 15:10:50,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 15:10:50,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 15:10:50,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 15:10:50,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 15:10:50,591 INFO L87 Difference]: Start difference. First operand 68 states and 86 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-13 15:10:50,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 15:10:50,623 INFO L93 Difference]: Finished difference Result 118 states and 147 transitions. [2024-10-13 15:10:50,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 15:10:50,624 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 39 [2024-10-13 15:10:50,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 15:10:50,625 INFO L225 Difference]: With dead ends: 118 [2024-10-13 15:10:50,626 INFO L226 Difference]: Without dead ends: 74 [2024-10-13 15:10:50,627 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 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-13 15:10:50,627 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 1 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 15:10:50,630 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 158 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 15:10:50,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-10-13 15:10:50,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2024-10-13 15:10:50,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 48 states have (on average 1.3125) internal successors, (63), 53 states have internal predecessors, (63), 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-13 15:10:50,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 93 transitions. [2024-10-13 15:10:50,636 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 93 transitions. Word has length 39 [2024-10-13 15:10:50,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 15:10:50,636 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 93 transitions. [2024-10-13 15:10:50,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-13 15:10:50,636 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 93 transitions. [2024-10-13 15:10:50,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-13 15:10:50,637 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 15:10:50,637 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] [2024-10-13 15:10:50,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 15:10:50,637 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-13 15:10:50,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 15:10:50,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1057507808, now seen corresponding path program 1 times [2024-10-13 15:10:50,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 15:10:50,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629915188] [2024-10-13 15:10:50,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 15:10:50,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 15:10:50,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:50,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 15:10:50,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:50,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 15:10:50,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:50,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 15:10:50,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:50,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 15:10:50,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:50,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 15:10:50,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:50,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 15:10:50,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:50,704 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-13 15:10:50,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 15:10:50,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629915188] [2024-10-13 15:10:50,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629915188] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 15:10:50,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1155746365] [2024-10-13 15:10:50,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 15:10:50,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 15:10:50,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 15:10:50,706 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 15:10:50,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 15:10:50,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:50,780 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 15:10:50,785 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 15:10:50,823 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-13 15:10:50,823 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 15:10:50,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1155746365] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 15:10:50,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 15:10:50,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-10-13 15:10:50,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607241217] [2024-10-13 15:10:50,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 15:10:50,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 15:10:50,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 15:10:50,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 15:10:50,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 15:10:50,825 INFO L87 Difference]: Start difference. First operand 73 states and 93 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-13 15:10:50,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 15:10:50,854 INFO L93 Difference]: Finished difference Result 114 states and 141 transitions. [2024-10-13 15:10:50,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 15:10:50,855 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 39 [2024-10-13 15:10:50,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 15:10:50,856 INFO L225 Difference]: With dead ends: 114 [2024-10-13 15:10:50,856 INFO L226 Difference]: Without dead ends: 67 [2024-10-13 15:10:50,856 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 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-13 15:10:50,857 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 1 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 145 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-13 15:10:50,857 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 145 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 15:10:50,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-13 15:10:50,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2024-10-13 15:10:50,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 44 states have (on average 1.25) internal successors, (55), 47 states have internal predecessors, (55), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-13 15:10:50,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 83 transitions. [2024-10-13 15:10:50,863 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 83 transitions. Word has length 39 [2024-10-13 15:10:50,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 15:10:50,864 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 83 transitions. [2024-10-13 15:10:50,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-13 15:10:50,864 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 83 transitions. [2024-10-13 15:10:50,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-13 15:10:50,865 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 15:10:50,865 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] [2024-10-13 15:10:50,878 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-13 15:10:51,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 15:10:51,070 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 15:10:51,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 15:10:51,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1332653499, now seen corresponding path program 1 times [2024-10-13 15:10:51,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 15:10:51,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287661229] [2024-10-13 15:10:51,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 15:10:51,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 15:10:51,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:51,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 15:10:51,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:51,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 15:10:51,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:51,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 15:10:51,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:51,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 15:10:51,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:51,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 15:10:51,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:51,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 15:10:51,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:51,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-13 15:10:51,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:51,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 15:10:51,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:51,131 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-13 15:10:51,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 15:10:51,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287661229] [2024-10-13 15:10:51,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287661229] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 15:10:51,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196787152] [2024-10-13 15:10:51,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 15:10:51,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 15:10:51,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 15:10:51,134 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 15:10:51,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 15:10:51,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:51,199 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 15:10:51,200 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 15:10:51,227 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-13 15:10:51,229 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 15:10:51,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1196787152] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 15:10:51,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 15:10:51,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-10-13 15:10:51,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584115828] [2024-10-13 15:10:51,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 15:10:51,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 15:10:51,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 15:10:51,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 15:10:51,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 15:10:51,231 INFO L87 Difference]: Start difference. First operand 66 states and 83 transitions. Second operand has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 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-13 15:10:51,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 15:10:51,258 INFO L93 Difference]: Finished difference Result 88 states and 110 transitions. [2024-10-13 15:10:51,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 15:10:51,258 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 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 49 [2024-10-13 15:10:51,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 15:10:51,260 INFO L225 Difference]: With dead ends: 88 [2024-10-13 15:10:51,260 INFO L226 Difference]: Without dead ends: 73 [2024-10-13 15:10:51,261 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 64 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-13 15:10:51,263 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 2 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 135 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-13 15:10:51,263 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 135 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 15:10:51,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-10-13 15:10:51,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2024-10-13 15:10:51,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 48 states have (on average 1.25) internal successors, (60), 51 states have internal predecessors, (60), 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-13 15:10:51,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 90 transitions. [2024-10-13 15:10:51,275 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 90 transitions. Word has length 49 [2024-10-13 15:10:51,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 15:10:51,275 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 90 transitions. [2024-10-13 15:10:51,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 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-13 15:10:51,276 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 90 transitions. [2024-10-13 15:10:51,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-13 15:10:51,278 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 15:10:51,278 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] [2024-10-13 15:10:51,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-13 15:10:51,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-13 15:10:51,483 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 15:10:51,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 15:10:51,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1637414348, now seen corresponding path program 1 times [2024-10-13 15:10:51,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 15:10:51,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470144245] [2024-10-13 15:10:51,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 15:10:51,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 15:10:51,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:51,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 15:10:51,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:51,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 15:10:51,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:51,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 15:10:51,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:51,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 15:10:51,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:51,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 15:10:51,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:51,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 15:10:51,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:51,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-13 15:10:51,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:51,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 15:10:51,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:51,580 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-13 15:10:51,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 15:10:51,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470144245] [2024-10-13 15:10:51,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470144245] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 15:10:51,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [584478566] [2024-10-13 15:10:51,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 15:10:51,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 15:10:51,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 15:10:51,585 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 15:10:51,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-13 15:10:51,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:51,653 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 15:10:51,655 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 15:10:51,679 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-13 15:10:51,680 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 15:10:51,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [584478566] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 15:10:51,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 15:10:51,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-10-13 15:10:51,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950908851] [2024-10-13 15:10:51,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 15:10:51,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 15:10:51,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 15:10:51,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 15:10:51,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 15:10:51,682 INFO L87 Difference]: Start difference. First operand 71 states and 90 transitions. Second operand has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 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-13 15:10:51,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 15:10:51,703 INFO L93 Difference]: Finished difference Result 72 states and 91 transitions. [2024-10-13 15:10:51,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 15:10:51,703 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 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 50 [2024-10-13 15:10:51,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 15:10:51,704 INFO L225 Difference]: With dead ends: 72 [2024-10-13 15:10:51,706 INFO L226 Difference]: Without dead ends: 71 [2024-10-13 15:10:51,706 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 65 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-13 15:10:51,707 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 4 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 124 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-13 15:10:51,707 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 124 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 15:10:51,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-13 15:10:51,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2024-10-13 15:10:51,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 50 states have internal predecessors, (59), 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-13 15:10:51,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 89 transitions. [2024-10-13 15:10:51,712 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 89 transitions. Word has length 50 [2024-10-13 15:10:51,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 15:10:51,713 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 89 transitions. [2024-10-13 15:10:51,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 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-13 15:10:51,713 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 89 transitions. [2024-10-13 15:10:51,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-13 15:10:51,714 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 15:10:51,714 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 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] [2024-10-13 15:10:51,729 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-13 15:10:51,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 15:10:51,918 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 15:10:51,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 15:10:51,919 INFO L85 PathProgramCache]: Analyzing trace with hash -801491864, now seen corresponding path program 1 times [2024-10-13 15:10:51,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 15:10:51,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794500724] [2024-10-13 15:10:51,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 15:10:51,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 15:10:51,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:51,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 15:10:51,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:51,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 15:10:51,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:51,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 15:10:51,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:51,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 15:10:51,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:51,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 15:10:51,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:51,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 15:10:51,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:51,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-13 15:10:51,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:51,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 15:10:51,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:51,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-13 15:10:51,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:51,989 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-10-13 15:10:51,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 15:10:51,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794500724] [2024-10-13 15:10:51,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794500724] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 15:10:51,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1520222821] [2024-10-13 15:10:51,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 15:10:51,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 15:10:51,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 15:10:51,994 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 15:10:51,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-13 15:10:52,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:52,055 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 15:10:52,056 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 15:10:52,076 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-13 15:10:52,076 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 15:10:52,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1520222821] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 15:10:52,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 15:10:52,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-10-13 15:10:52,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428405772] [2024-10-13 15:10:52,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 15:10:52,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 15:10:52,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 15:10:52,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 15:10:52,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 15:10:52,078 INFO L87 Difference]: Start difference. First operand 70 states and 89 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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-13 15:10:52,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 15:10:52,096 INFO L93 Difference]: Finished difference Result 90 states and 110 transitions. [2024-10-13 15:10:52,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 15:10:52,097 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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 55 [2024-10-13 15:10:52,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 15:10:52,097 INFO L225 Difference]: With dead ends: 90 [2024-10-13 15:10:52,097 INFO L226 Difference]: Without dead ends: 69 [2024-10-13 15:10:52,098 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 72 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-13 15:10:52,100 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 1 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 15:10:52,100 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 138 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 15:10:52,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-10-13 15:10:52,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2024-10-13 15:10:52,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 48 states have internal predecessors, (56), 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-13 15:10:52,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 86 transitions. [2024-10-13 15:10:52,108 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 86 transitions. Word has length 55 [2024-10-13 15:10:52,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 15:10:52,110 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 86 transitions. [2024-10-13 15:10:52,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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-13 15:10:52,110 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 86 transitions. [2024-10-13 15:10:52,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-13 15:10:52,111 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 15:10:52,111 INFO L215 NwaCegarLoop]: trace histogram [6, 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] [2024-10-13 15:10:52,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-13 15:10:52,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 15:10:52,312 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 15:10:52,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 15:10:52,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1214783797, now seen corresponding path program 1 times [2024-10-13 15:10:52,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 15:10:52,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439093853] [2024-10-13 15:10:52,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 15:10:52,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 15:10:52,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:52,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 15:10:52,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:52,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 15:10:52,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:52,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 15:10:52,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:52,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 15:10:52,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:52,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 15:10:52,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:52,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 15:10:52,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:52,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-13 15:10:52,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:52,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 15:10:52,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:52,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-13 15:10:52,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:52,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 15:10:52,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:52,396 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-10-13 15:10:52,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 15:10:52,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439093853] [2024-10-13 15:10:52,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439093853] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 15:10:52,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [632608586] [2024-10-13 15:10:52,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 15:10:52,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 15:10:52,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 15:10:52,398 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 15:10:52,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-13 15:10:52,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:52,453 INFO L255 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 15:10:52,454 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 15:10:52,471 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-13 15:10:52,471 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 15:10:52,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [632608586] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 15:10:52,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 15:10:52,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-10-13 15:10:52,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592213764] [2024-10-13 15:10:52,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 15:10:52,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 15:10:52,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 15:10:52,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 15:10:52,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 15:10:52,473 INFO L87 Difference]: Start difference. First operand 68 states and 86 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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-13 15:10:52,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 15:10:52,492 INFO L93 Difference]: Finished difference Result 76 states and 94 transitions. [2024-10-13 15:10:52,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 15:10:52,493 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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 60 [2024-10-13 15:10:52,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 15:10:52,493 INFO L225 Difference]: With dead ends: 76 [2024-10-13 15:10:52,493 INFO L226 Difference]: Without dead ends: 68 [2024-10-13 15:10:52,494 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 79 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-13 15:10:52,494 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 0 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 15:10:52,494 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 15:10:52,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-13 15:10:52,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-10-13 15:10:52,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 48 states have internal predecessors, (55), 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-13 15:10:52,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 85 transitions. [2024-10-13 15:10:52,501 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 85 transitions. Word has length 60 [2024-10-13 15:10:52,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 15:10:52,502 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 85 transitions. [2024-10-13 15:10:52,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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-13 15:10:52,502 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 85 transitions. [2024-10-13 15:10:52,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-13 15:10:52,503 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 15:10:52,503 INFO L215 NwaCegarLoop]: trace histogram [6, 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] [2024-10-13 15:10:52,515 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-13 15:10:52,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 15:10:52,704 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 15:10:52,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 15:10:52,704 INFO L85 PathProgramCache]: Analyzing trace with hash 2024130423, now seen corresponding path program 1 times [2024-10-13 15:10:52,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 15:10:52,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71070332] [2024-10-13 15:10:52,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 15:10:52,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 15:10:52,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:52,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 15:10:52,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:52,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 15:10:52,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:52,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 15:10:52,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:52,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 15:10:52,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:52,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 15:10:52,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:52,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 15:10:52,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:52,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-13 15:10:52,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:52,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 15:10:52,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:52,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-13 15:10:52,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:52,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 15:10:52,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:52,763 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-10-13 15:10:52,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 15:10:52,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71070332] [2024-10-13 15:10:52,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71070332] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 15:10:52,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [837201143] [2024-10-13 15:10:52,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 15:10:52,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 15:10:52,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 15:10:52,766 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 15:10:52,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-13 15:10:52,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:52,828 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 15:10:52,830 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 15:10:52,851 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-13 15:10:52,852 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 15:10:52,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [837201143] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 15:10:52,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 15:10:52,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-10-13 15:10:52,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446472879] [2024-10-13 15:10:52,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 15:10:52,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 15:10:52,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 15:10:52,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 15:10:52,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 15:10:52,853 INFO L87 Difference]: Start difference. First operand 68 states and 85 transitions. Second operand has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 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-13 15:10:52,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 15:10:52,862 INFO L93 Difference]: Finished difference Result 68 states and 85 transitions. [2024-10-13 15:10:52,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 15:10:52,863 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 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 60 [2024-10-13 15:10:52,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 15:10:52,864 INFO L225 Difference]: With dead ends: 68 [2024-10-13 15:10:52,864 INFO L226 Difference]: Without dead ends: 67 [2024-10-13 15:10:52,864 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 79 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-13 15:10:52,864 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 1 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 15:10:52,865 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 129 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 15:10:52,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-13 15:10:52,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-10-13 15:10:52,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 47 states have (on average 1.148936170212766) internal successors, (54), 47 states have internal predecessors, (54), 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-13 15:10:52,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 84 transitions. [2024-10-13 15:10:52,868 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 84 transitions. Word has length 60 [2024-10-13 15:10:52,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 15:10:52,869 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 84 transitions. [2024-10-13 15:10:52,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 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-13 15:10:52,869 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 84 transitions. [2024-10-13 15:10:52,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-13 15:10:52,870 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 15:10:52,870 INFO L215 NwaCegarLoop]: trace histogram [6, 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] [2024-10-13 15:10:52,882 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-13 15:10:53,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 15:10:53,071 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 15:10:53,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 15:10:53,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1676466155, now seen corresponding path program 1 times [2024-10-13 15:10:53,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 15:10:53,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945426572] [2024-10-13 15:10:53,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 15:10:53,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 15:10:53,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:53,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 15:10:53,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:53,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 15:10:53,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:53,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 15:10:53,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:53,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 15:10:53,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:53,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 15:10:53,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:53,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 15:10:53,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:53,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-13 15:10:53,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:53,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 15:10:53,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:53,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-13 15:10:53,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:53,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 15:10:53,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:53,144 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-10-13 15:10:53,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 15:10:53,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945426572] [2024-10-13 15:10:53,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945426572] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 15:10:53,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1799468764] [2024-10-13 15:10:53,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 15:10:53,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 15:10:53,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 15:10:53,146 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 15:10:53,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-13 15:10:53,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:10:53,205 INFO L255 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 15:10:53,206 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 15:10:53,223 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-13 15:10:53,224 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 15:10:53,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1799468764] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 15:10:53,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 15:10:53,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-10-13 15:10:53,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431210059] [2024-10-13 15:10:53,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 15:10:53,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 15:10:53,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 15:10:53,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 15:10:53,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 15:10:53,225 INFO L87 Difference]: Start difference. First operand 67 states and 84 transitions. Second operand has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 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-13 15:10:53,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 15:10:53,236 INFO L93 Difference]: Finished difference Result 67 states and 84 transitions. [2024-10-13 15:10:53,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 15:10:53,237 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 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 61 [2024-10-13 15:10:53,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 15:10:53,237 INFO L225 Difference]: With dead ends: 67 [2024-10-13 15:10:53,237 INFO L226 Difference]: Without dead ends: 0 [2024-10-13 15:10:53,237 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 80 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-13 15:10:53,239 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 1 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 15:10:53,239 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 127 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 15:10:53,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-13 15:10:53,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-13 15:10:53,240 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-13 15:10:53,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-13 15:10:53,240 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 61 [2024-10-13 15:10:53,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 15:10:53,240 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 15:10:53,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 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-13 15:10:53,241 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-13 15:10:53,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-13 15:10:53,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2024-10-13 15:10:53,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2024-10-13 15:10:53,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2024-10-13 15:10:53,244 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2024-10-13 15:10:53,244 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2024-10-13 15:10:53,244 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2024-10-13 15:10:53,244 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2024-10-13 15:10:53,244 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2024-10-13 15:10:53,256 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-13 15:10:53,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 15:10:53,448 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 15:10:53,449 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-13 15:10:53,487 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 15:10:53,504 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 03:10:53 BoogieIcfgContainer [2024-10-13 15:10:53,504 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 15:10:53,505 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 15:10:53,505 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 15:10:53,505 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 15:10:53,505 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:10:49" (3/4) ... [2024-10-13 15:10:53,507 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 15:10:53,509 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2024-10-13 15:10:53,509 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure globalReturnsFalse [2024-10-13 15:10:53,509 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2024-10-13 15:10:53,510 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure globalReturnsTrue [2024-10-13 15:10:53,516 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2024-10-13 15:10:53,516 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2024-10-13 15:10:53,517 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-13 15:10:53,517 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-13 15:10:53,603 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 15:10:53,603 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-13 15:10:53,603 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 15:10:53,604 INFO L158 Benchmark]: Toolchain (without parser) took 5169.40ms. Allocated memory was 178.3MB in the beginning and 218.1MB in the end (delta: 39.8MB). Free memory was 104.2MB in the beginning and 74.8MB in the end (delta: 29.4MB). Peak memory consumption was 70.2MB. Max. memory is 16.1GB. [2024-10-13 15:10:53,604 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 113.2MB. Free memory is still 76.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 15:10:53,604 INFO L158 Benchmark]: CACSL2BoogieTranslator took 766.34ms. Allocated memory is still 178.3MB. Free memory was 104.0MB in the beginning and 90.4MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-13 15:10:53,604 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.87ms. Allocated memory is still 178.3MB. Free memory was 90.4MB in the beginning and 87.1MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 15:10:53,604 INFO L158 Benchmark]: Boogie Preprocessor took 27.82ms. Allocated memory is still 178.3MB. Free memory was 87.1MB in the beginning and 85.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 15:10:53,604 INFO L158 Benchmark]: RCFGBuilder took 391.75ms. Allocated memory is still 178.3MB. Free memory was 85.0MB in the beginning and 133.7MB in the end (delta: -48.6MB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB. [2024-10-13 15:10:53,605 INFO L158 Benchmark]: TraceAbstraction took 3821.88ms. Allocated memory was 178.3MB in the beginning and 218.1MB in the end (delta: 39.8MB). Free memory was 132.6MB in the beginning and 82.1MB in the end (delta: 50.5MB). Peak memory consumption was 90.3MB. Max. memory is 16.1GB. [2024-10-13 15:10:53,605 INFO L158 Benchmark]: Witness Printer took 98.67ms. Allocated memory is still 218.1MB. Free memory was 81.1MB in the beginning and 74.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 15:10:53,606 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.13ms. Allocated memory is still 113.2MB. Free memory is still 76.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 766.34ms. Allocated memory is still 178.3MB. Free memory was 104.0MB in the beginning and 90.4MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.87ms. Allocated memory is still 178.3MB. Free memory was 90.4MB in the beginning and 87.1MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.82ms. Allocated memory is still 178.3MB. Free memory was 87.1MB in the beginning and 85.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 391.75ms. Allocated memory is still 178.3MB. Free memory was 85.0MB in the beginning and 133.7MB in the end (delta: -48.6MB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3821.88ms. Allocated memory was 178.3MB in the beginning and 218.1MB in the end (delta: 39.8MB). Free memory was 132.6MB in the beginning and 82.1MB in the end (delta: 50.5MB). Peak memory consumption was 90.3MB. Max. memory is 16.1GB. * Witness Printer took 98.67ms. Allocated memory is still 218.1MB. Free memory was 81.1MB in the beginning and 74.8MB in the end (delta: 6.3MB). 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: 1566]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1566]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1590]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1590]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1616]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1616]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1633]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1633]: 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, 82 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 3.7s, OverallIterations: 11, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 17 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13 mSDsluCounter, 1776 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 919 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 187 IncrementalHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 857 mSDtfsCounter, 187 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 558 GetRequests, 531 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82occurred in iteration=0, InterpolantAutomatonStates: 35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 9 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 864 NumberOfCodeBlocks, 864 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 846 ConstructedInterpolants, 0 QuantifiedInterpolants, 1010 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1206 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 18 InterpolantComputations, 11 PerfectInterpolantSequences, 367/380 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: 1514]: Procedure Contract for globalReturnsFalse Derived contract for procedure globalReturnsFalse. Ensures: (\result == 0) - ProcedureContractResult [Line: 1510]: Procedure Contract for globalReturnsTrue Derived contract for procedure globalReturnsTrue. Ensures: (\result == 1) RESULT: Ultimate proved your program to be correct! [2024-10-13 15:10:53,627 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE