./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-numeric/java_LogBuiltIn.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/termination-numeric/java_LogBuiltIn.c -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 6d6de59cf2b416f7340c8c861064933450d6034e9a050a1b7fe5107e8fa4152f --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 16:50:21,449 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 16:50:21,505 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-11-12 16:50:21,521 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 16:50:21,522 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 16:50:21,556 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 16:50:21,558 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 16:50:21,558 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 16:50:21,559 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 16:50:21,559 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 16:50:21,560 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 16:50:21,560 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 16:50:21,561 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 16:50:21,563 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 16:50:21,563 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 16:50:21,564 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 16:50:21,564 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 16:50:21,564 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 16:50:21,564 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 16:50:21,565 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 16:50:21,565 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 16:50:21,568 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 16:50:21,569 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 16:50:21,569 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-12 16:50:21,569 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 16:50:21,569 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 16:50:21,569 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 16:50:21,570 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 16:50:21,570 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 16:50:21,570 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 16:50:21,570 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 16:50:21,571 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 16:50:21,571 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 16:50:21,571 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 16:50:21,571 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 16:50:21,572 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 16:50:21,572 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 16:50:21,572 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 16:50:21,574 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 16:50:21,575 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 16:50:21,575 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 16:50:21,575 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 -> 6d6de59cf2b416f7340c8c861064933450d6034e9a050a1b7fe5107e8fa4152f [2024-11-12 16:50:21,832 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 16:50:21,850 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 16:50:21,853 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 16:50:21,856 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 16:50:21,856 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 16:50:21,857 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-numeric/java_LogBuiltIn.c [2024-11-12 16:50:23,321 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 16:50:23,500 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 16:50:23,501 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-numeric/java_LogBuiltIn.c [2024-11-12 16:50:23,509 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/940992e82/7565d2a703634953adde70fda53a7f9b/FLAGfb7785e1b [2024-11-12 16:50:23,524 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/940992e82/7565d2a703634953adde70fda53a7f9b [2024-11-12 16:50:23,527 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 16:50:23,528 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 16:50:23,532 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 16:50:23,532 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 16:50:23,537 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 16:50:23,538 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:50:23" (1/1) ... [2024-11-12 16:50:23,539 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2865b2d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:50:23, skipping insertion in model container [2024-11-12 16:50:23,539 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:50:23" (1/1) ... [2024-11-12 16:50:23,555 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 16:50:23,740 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 16:50:23,745 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 16:50:23,754 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 16:50:23,769 INFO L204 MainTranslator]: Completed translation [2024-11-12 16:50:23,769 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:50:23 WrapperNode [2024-11-12 16:50:23,769 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 16:50:23,770 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 16:50:23,770 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 16:50:23,770 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 16:50:23,776 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:50:23" (1/1) ... [2024-11-12 16:50:23,779 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:50:23" (1/1) ... [2024-11-12 16:50:23,794 INFO L138 Inliner]: procedures = 5, calls = 3, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 28 [2024-11-12 16:50:23,794 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 16:50:23,795 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 16:50:23,795 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 16:50:23,795 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 16:50:23,803 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:50:23" (1/1) ... [2024-11-12 16:50:23,803 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:50:23" (1/1) ... [2024-11-12 16:50:23,804 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:50:23" (1/1) ... [2024-11-12 16:50:23,809 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-12 16:50:23,810 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:50:23" (1/1) ... [2024-11-12 16:50:23,810 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:50:23" (1/1) ... [2024-11-12 16:50:23,811 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:50:23" (1/1) ... [2024-11-12 16:50:23,816 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:50:23" (1/1) ... [2024-11-12 16:50:23,816 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:50:23" (1/1) ... [2024-11-12 16:50:23,817 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:50:23" (1/1) ... [2024-11-12 16:50:23,818 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 16:50:23,819 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 16:50:23,819 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 16:50:23,819 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 16:50:23,820 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:50:23" (1/1) ... [2024-11-12 16:50:23,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 16:50:23,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:50:23,858 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 16:50:23,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 16:50:23,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 16:50:23,910 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 16:50:23,966 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 16:50:23,968 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 16:50:24,088 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-12 16:50:24,088 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 16:50:24,104 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 16:50:24,105 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 16:50:24,105 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:50:24 BoogieIcfgContainer [2024-11-12 16:50:24,105 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 16:50:24,109 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 16:50:24,110 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 16:50:24,113 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 16:50:24,114 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 04:50:23" (1/3) ... [2024-11-12 16:50:24,114 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bfdcea5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:50:24, skipping insertion in model container [2024-11-12 16:50:24,116 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:50:23" (2/3) ... [2024-11-12 16:50:24,116 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bfdcea5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:50:24, skipping insertion in model container [2024-11-12 16:50:24,116 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:50:24" (3/3) ... [2024-11-12 16:50:24,118 INFO L112 eAbstractionObserver]: Analyzing ICFG java_LogBuiltIn.c [2024-11-12 16:50:24,136 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 16:50:24,136 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-12 16:50:24,205 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 16:50:24,213 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;@14c32b30, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 16:50:24,213 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-12 16:50:24,217 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:50:24,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-12 16:50:24,221 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:50:24,222 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-12 16:50:24,223 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-12 16:50:24,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:50:24,230 INFO L85 PathProgramCache]: Analyzing trace with hash 925796, now seen corresponding path program 1 times [2024-11-12 16:50:24,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:50:24,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634200289] [2024-11-12 16:50:24,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:50:24,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:50:24,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:50:24,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:50:24,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:50:24,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634200289] [2024-11-12 16:50:24,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634200289] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:50:24,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:50:24,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 16:50:24,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984059463] [2024-11-12 16:50:24,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:50:24,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 16:50:24,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:50:24,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 16:50:24,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 16:50:24,463 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:50:24,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:50:24,503 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2024-11-12 16:50:24,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 16:50:24,510 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-12 16:50:24,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:50:24,527 INFO L225 Difference]: With dead ends: 21 [2024-11-12 16:50:24,528 INFO L226 Difference]: Without dead ends: 10 [2024-11-12 16:50:24,531 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 16:50:24,538 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 1 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 16:50:24,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 20 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 16:50:24,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-11-12 16:50:24,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2024-11-12 16:50:24,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:50:24,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2024-11-12 16:50:24,572 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 4 [2024-11-12 16:50:24,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:50:24,572 INFO L471 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2024-11-12 16:50:24,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:50:24,573 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2024-11-12 16:50:24,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-12 16:50:24,573 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:50:24,574 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-12 16:50:24,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 16:50:24,574 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-12 16:50:24,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:50:24,575 INFO L85 PathProgramCache]: Analyzing trace with hash 28699721, now seen corresponding path program 1 times [2024-11-12 16:50:24,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:50:24,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000225891] [2024-11-12 16:50:24,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:50:24,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:50:24,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:50:24,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:50:24,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:50:24,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000225891] [2024-11-12 16:50:24,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000225891] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:50:24,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:50:24,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 16:50:24,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890403620] [2024-11-12 16:50:24,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:50:24,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 16:50:24,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:50:24,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 16:50:24,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 16:50:24,771 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:50:24,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:50:24,787 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2024-11-12 16:50:24,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 16:50:24,788 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-12 16:50:24,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:50:24,788 INFO L225 Difference]: With dead ends: 10 [2024-11-12 16:50:24,788 INFO L226 Difference]: Without dead ends: 9 [2024-11-12 16:50:24,789 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 16:50:24,790 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 4 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 16:50:24,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 12 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 16:50:24,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-11-12 16:50:24,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2024-11-12 16:50:24,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:50:24,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-12 16:50:24,797 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-11-12 16:50:24,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:50:24,797 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-12 16:50:24,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:50:24,798 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-12 16:50:24,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-12 16:50:24,798 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:50:24,798 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-12 16:50:24,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 16:50:24,799 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-12 16:50:24,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:50:24,799 INFO L85 PathProgramCache]: Analyzing trace with hash 889691398, now seen corresponding path program 1 times [2024-11-12 16:50:24,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:50:24,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465249511] [2024-11-12 16:50:24,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:50:24,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:50:24,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:50:24,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:50:24,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:50:24,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465249511] [2024-11-12 16:50:24,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465249511] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:50:24,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:50:24,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 16:50:24,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833436149] [2024-11-12 16:50:24,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:50:24,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 16:50:24,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:50:24,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 16:50:24,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 16:50:24,872 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:50:24,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:50:24,891 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2024-11-12 16:50:24,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 16:50:24,891 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-12 16:50:24,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:50:24,892 INFO L225 Difference]: With dead ends: 9 [2024-11-12 16:50:24,892 INFO L226 Difference]: Without dead ends: 8 [2024-11-12 16:50:24,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 16:50:24,894 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 1 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 8 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-11-12 16:50:24,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 8 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 16:50:24,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2024-11-12 16:50:24,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2024-11-12 16:50:24,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:50:24,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2024-11-12 16:50:24,901 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2024-11-12 16:50:24,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:50:24,901 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2024-11-12 16:50:24,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:50:24,902 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2024-11-12 16:50:24,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-12 16:50:24,902 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:50:24,902 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:50:24,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 16:50:24,902 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-12 16:50:24,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:50:24,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1810629611, now seen corresponding path program 1 times [2024-11-12 16:50:24,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:50:24,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651646317] [2024-11-12 16:50:24,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:50:24,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:50:24,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:50:24,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:50:24,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:50:24,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651646317] [2024-11-12 16:50:24,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651646317] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:50:24,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:50:24,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 16:50:24,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560235105] [2024-11-12 16:50:24,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:50:24,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 16:50:24,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:50:24,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 16:50:24,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 16:50:24,980 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:50:25,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:50:25,005 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2024-11-12 16:50:25,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 16:50:25,005 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-12 16:50:25,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:50:25,006 INFO L225 Difference]: With dead ends: 14 [2024-11-12 16:50:25,006 INFO L226 Difference]: Without dead ends: 13 [2024-11-12 16:50:25,007 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 16:50:25,009 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 16:50:25,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 12 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 16:50:25,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-11-12 16:50:25,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-11-12 16:50:25,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:50:25,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2024-11-12 16:50:25,036 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 7 [2024-11-12 16:50:25,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:50:25,036 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2024-11-12 16:50:25,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:50:25,037 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2024-11-12 16:50:25,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-12 16:50:25,037 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:50:25,037 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1] [2024-11-12 16:50:25,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 16:50:25,038 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-12 16:50:25,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:50:25,039 INFO L85 PathProgramCache]: Analyzing trace with hash -646531742, now seen corresponding path program 1 times [2024-11-12 16:50:25,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:50:25,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228908369] [2024-11-12 16:50:25,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:50:25,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:50:25,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:50:25,156 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:50:25,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:50:25,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228908369] [2024-11-12 16:50:25,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228908369] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 16:50:25,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [28004116] [2024-11-12 16:50:25,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:50:25,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:50:25,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:50:25,161 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 16:50:25,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 16:50:25,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:50:25,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 16:50:25,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:50:25,271 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:50:25,272 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 16:50:25,359 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:50:25,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [28004116] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 16:50:25,359 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 16:50:25,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-11-12 16:50:25,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995826100] [2024-11-12 16:50:25,360 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 16:50:25,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 16:50:25,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:50:25,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 16:50:25,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-12 16:50:25,363 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:50:25,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:50:25,410 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2024-11-12 16:50:25,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 16:50:25,411 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-12 16:50:25,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:50:25,412 INFO L225 Difference]: With dead ends: 29 [2024-11-12 16:50:25,412 INFO L226 Difference]: Without dead ends: 28 [2024-11-12 16:50:25,412 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-12 16:50:25,413 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 18 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-11-12 16:50:25,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 16:50:25,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-12 16:50:25,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-12 16:50:25,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:50:25,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2024-11-12 16:50:25,425 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 12 [2024-11-12 16:50:25,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:50:25,425 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2024-11-12 16:50:25,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:50:25,426 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2024-11-12 16:50:25,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-12 16:50:25,426 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:50:25,427 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 1, 1, 1] [2024-11-12 16:50:25,445 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-12 16:50:25,627 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-11-12 16:50:25,628 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-12 16:50:25,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:50:25,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1214197931, now seen corresponding path program 2 times [2024-11-12 16:50:25,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:50:25,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582497538] [2024-11-12 16:50:25,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:50:25,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:50:25,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:50:25,917 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:50:25,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:50:25,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582497538] [2024-11-12 16:50:25,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582497538] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 16:50:25,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [538795719] [2024-11-12 16:50:25,919 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 16:50:25,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:50:25,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:50:25,921 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 16:50:25,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-12 16:50:25,982 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 16:50:25,982 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 16:50:25,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-12 16:50:25,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:50:26,059 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:50:26,059 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 16:50:26,278 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:50:26,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [538795719] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 16:50:26,282 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 16:50:26,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2024-11-12 16:50:26,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419823084] [2024-11-12 16:50:26,283 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 16:50:26,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-12 16:50:26,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:50:26,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-12 16:50:26,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2024-11-12 16:50:26,288 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand has 22 states, 21 states have (on average 2.5238095238095237) internal successors, (53), 22 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:50:26,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:50:26,367 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2024-11-12 16:50:26,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-12 16:50:26,367 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.5238095238095237) internal successors, (53), 22 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-12 16:50:26,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:50:26,370 INFO L225 Difference]: With dead ends: 59 [2024-11-12 16:50:26,371 INFO L226 Difference]: Without dead ends: 58 [2024-11-12 16:50:26,372 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2024-11-12 16:50:26,373 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 16:50:26,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 40 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 16:50:26,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-12 16:50:26,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-12 16:50:26,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 1.0175438596491229) internal successors, (58), 57 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:50:26,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2024-11-12 16:50:26,384 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 27 [2024-11-12 16:50:26,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:50:26,384 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2024-11-12 16:50:26,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.5238095238095237) internal successors, (53), 22 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:50:26,385 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2024-11-12 16:50:26,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-12 16:50:26,387 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:50:26,387 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 10, 1, 1, 1] [2024-11-12 16:50:26,404 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-12 16:50:26,588 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-11-12 16:50:26,588 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-12 16:50:26,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:50:26,589 INFO L85 PathProgramCache]: Analyzing trace with hash -869666869, now seen corresponding path program 3 times [2024-11-12 16:50:26,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:50:26,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549567928] [2024-11-12 16:50:26,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:50:26,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:50:26,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:50:27,318 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:50:27,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:50:27,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549567928] [2024-11-12 16:50:27,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549567928] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 16:50:27,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [7063252] [2024-11-12 16:50:27,322 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-12 16:50:27,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:50:27,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:50:27,324 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 16:50:27,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-12 16:50:27,392 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-11-12 16:50:27,393 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 16:50:27,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-12 16:50:27,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:50:27,500 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:50:27,501 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 16:50:28,124 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:50:28,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [7063252] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 16:50:28,124 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 16:50:28,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2024-11-12 16:50:28,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193443416] [2024-11-12 16:50:28,125 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 16:50:28,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-11-12 16:50:28,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:50:28,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-11-12 16:50:28,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=551, Invalid=1519, Unknown=0, NotChecked=0, Total=2070 [2024-11-12 16:50:28,128 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand has 46 states, 45 states have (on average 2.511111111111111) internal successors, (113), 46 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:50:28,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:50:28,260 INFO L93 Difference]: Finished difference Result 119 states and 130 transitions. [2024-11-12 16:50:28,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-11-12 16:50:28,261 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 2.511111111111111) internal successors, (113), 46 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2024-11-12 16:50:28,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:50:28,262 INFO L225 Difference]: With dead ends: 119 [2024-11-12 16:50:28,262 INFO L226 Difference]: Without dead ends: 118 [2024-11-12 16:50:28,263 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 541 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=551, Invalid=1519, Unknown=0, NotChecked=0, Total=2070 [2024-11-12 16:50:28,264 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 16:50:28,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 16:50:28,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-12 16:50:28,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-11-12 16:50:28,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 117 states have (on average 1.0085470085470085) internal successors, (118), 117 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:50:28,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2024-11-12 16:50:28,280 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 57 [2024-11-12 16:50:28,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:50:28,281 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2024-11-12 16:50:28,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 2.511111111111111) internal successors, (113), 46 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:50:28,281 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2024-11-12 16:50:28,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-12 16:50:28,285 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:50:28,285 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 23, 22, 1, 1, 1] [2024-11-12 16:50:28,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-12 16:50:28,485 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-11-12 16:50:28,486 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-12 16:50:28,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:50:28,487 INFO L85 PathProgramCache]: Analyzing trace with hash 389269003, now seen corresponding path program 4 times [2024-11-12 16:50:28,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:50:28,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707808732] [2024-11-12 16:50:28,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:50:28,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:50:28,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:50:30,412 INFO L134 CoverageAnalysis]: Checked inductivity of 1265 backedges. 0 proven. 1265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:50:30,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:50:30,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707808732] [2024-11-12 16:50:30,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707808732] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 16:50:30,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [362950583] [2024-11-12 16:50:30,413 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-12 16:50:30,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:50:30,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:50:30,415 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 16:50:30,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-12 16:50:30,500 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-12 16:50:30,501 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 16:50:30,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-12 16:50:30,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:50:30,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1265 backedges. 0 proven. 1265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:50:30,677 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 16:50:32,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1265 backedges. 0 proven. 1265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:50:32,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [362950583] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 16:50:32,760 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 16:50:32,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2024-11-12 16:50:32,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456602408] [2024-11-12 16:50:32,760 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 16:50:32,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 94 states [2024-11-12 16:50:32,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:50:32,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2024-11-12 16:50:32,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2255, Invalid=6487, Unknown=0, NotChecked=0, Total=8742 [2024-11-12 16:50:32,769 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand has 94 states, 93 states have (on average 2.5053763440860215) internal successors, (233), 94 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:50:33,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:50:33,021 INFO L93 Difference]: Finished difference Result 239 states and 262 transitions. [2024-11-12 16:50:33,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2024-11-12 16:50:33,021 INFO L78 Accepts]: Start accepts. Automaton has has 94 states, 93 states have (on average 2.5053763440860215) internal successors, (233), 94 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 117 [2024-11-12 16:50:33,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:50:33,025 INFO L225 Difference]: With dead ends: 239 [2024-11-12 16:50:33,025 INFO L226 Difference]: Without dead ends: 238 [2024-11-12 16:50:33,032 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2509 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2255, Invalid=6487, Unknown=0, NotChecked=0, Total=8742 [2024-11-12 16:50:33,034 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 16:50:33,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 123 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 16:50:33,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-11-12 16:50:33,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2024-11-12 16:50:33,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 237 states have (on average 1.0042194092827004) internal successors, (238), 237 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:50:33,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 238 transitions. [2024-11-12 16:50:33,057 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 238 transitions. Word has length 117 [2024-11-12 16:50:33,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:50:33,058 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 238 transitions. [2024-11-12 16:50:33,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 94 states, 93 states have (on average 2.5053763440860215) internal successors, (233), 94 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:50:33,058 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 238 transitions. [2024-11-12 16:50:33,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-11-12 16:50:33,062 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:50:33,063 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 47, 46, 1, 1, 1] [2024-11-12 16:50:33,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-12 16:50:33,266 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-11-12 16:50:33,267 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-12 16:50:33,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:50:33,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1928277365, now seen corresponding path program 5 times [2024-11-12 16:50:33,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:50:33,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338147720] [2024-11-12 16:50:33,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:50:33,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:50:33,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:50:41,133 INFO L134 CoverageAnalysis]: Checked inductivity of 5405 backedges. 4741 proven. 0 refuted. 0 times theorem prover too weak. 664 trivial. 0 not checked. [2024-11-12 16:50:41,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:50:41,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338147720] [2024-11-12 16:50:41,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338147720] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:50:41,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:50:41,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [63] imperfect sequences [] total 63 [2024-11-12 16:50:41,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841755586] [2024-11-12 16:50:41,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:50:41,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2024-11-12 16:50:41,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:50:41,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2024-11-12 16:50:41,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1488, Invalid=2418, Unknown=0, NotChecked=0, Total=3906 [2024-11-12 16:50:41,137 INFO L87 Difference]: Start difference. First operand 238 states and 238 transitions. Second operand has 63 states, 63 states have (on average 2.5238095238095237) internal successors, (159), 63 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:50:41,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:50:41,468 INFO L93 Difference]: Finished difference Result 238 states and 238 transitions. [2024-11-12 16:50:41,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2024-11-12 16:50:41,469 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 2.5238095238095237) internal successors, (159), 63 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 237 [2024-11-12 16:50:41,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:50:41,470 INFO L225 Difference]: With dead ends: 238 [2024-11-12 16:50:41,470 INFO L226 Difference]: Without dead ends: 0 [2024-11-12 16:50:41,472 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 2 SyntacticMatches, 30 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1488, Invalid=2418, Unknown=0, NotChecked=0, Total=3906 [2024-11-12 16:50:41,474 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 0 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 16:50:41,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 373 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 16:50:41,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-12 16:50:41,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-12 16:50:41,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:50:41,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-12 16:50:41,477 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 237 [2024-11-12 16:50:41,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:50:41,477 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-12 16:50:41,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 2.5238095238095237) internal successors, (159), 63 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:50:41,477 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-12 16:50:41,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-12 16:50:41,480 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-11-12 16:50:41,481 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-11-12 16:50:41,481 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-11-12 16:50:41,481 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-11-12 16:50:41,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 16:50:41,484 INFO L421 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1] [2024-11-12 16:50:41,487 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-12 16:50:41,723 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 16:50:41,756 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 04:50:41 BoogieIcfgContainer [2024-11-12 16:50:41,756 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 16:50:41,757 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 16:50:41,757 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 16:50:41,757 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 16:50:41,758 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:50:24" (3/4) ... [2024-11-12 16:50:41,760 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-12 16:50:41,766 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-12 16:50:41,767 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-12 16:50:41,767 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-12 16:50:41,852 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-12 16:50:41,853 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-12 16:50:41,853 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 16:50:41,853 INFO L158 Benchmark]: Toolchain (without parser) took 18325.01ms. Allocated memory was 165.7MB in the beginning and 528.5MB in the end (delta: 362.8MB). Free memory was 112.1MB in the beginning and 407.7MB in the end (delta: -295.7MB). Peak memory consumption was 68.3MB. Max. memory is 16.1GB. [2024-11-12 16:50:41,854 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 165.7MB. Free memory is still 129.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 16:50:41,854 INFO L158 Benchmark]: CACSL2BoogieTranslator took 238.02ms. Allocated memory is still 165.7MB. Free memory was 111.7MB in the beginning and 100.3MB in the end (delta: 11.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-12 16:50:41,854 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.97ms. Allocated memory is still 165.7MB. Free memory was 100.3MB in the beginning and 99.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 16:50:41,854 INFO L158 Benchmark]: Boogie Preprocessor took 23.15ms. Allocated memory is still 165.7MB. Free memory was 99.1MB in the beginning and 97.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 16:50:41,854 INFO L158 Benchmark]: RCFGBuilder took 286.90ms. Allocated memory is still 165.7MB. Free memory was 97.4MB in the beginning and 87.3MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-12 16:50:41,855 INFO L158 Benchmark]: TraceAbstraction took 17647.02ms. Allocated memory was 165.7MB in the beginning and 528.5MB in the end (delta: 362.8MB). Free memory was 86.5MB in the beginning and 413.0MB in the end (delta: -326.4MB). Peak memory consumption was 39.0MB. Max. memory is 16.1GB. [2024-11-12 16:50:41,855 INFO L158 Benchmark]: Witness Printer took 96.04ms. Allocated memory is still 528.5MB. Free memory was 411.9MB in the beginning and 407.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 16:50:41,860 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.20ms. Allocated memory is still 165.7MB. Free memory is still 129.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 238.02ms. Allocated memory is still 165.7MB. Free memory was 111.7MB in the beginning and 100.3MB in the end (delta: 11.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.97ms. Allocated memory is still 165.7MB. Free memory was 100.3MB in the beginning and 99.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 23.15ms. Allocated memory is still 165.7MB. Free memory was 99.1MB in the beginning and 97.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 286.90ms. Allocated memory is still 165.7MB. Free memory was 97.4MB in the beginning and 87.3MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 17647.02ms. Allocated memory was 165.7MB in the beginning and 528.5MB in the end (delta: 362.8MB). Free memory was 86.5MB in the beginning and 413.0MB in the end (delta: -326.4MB). Peak memory consumption was 39.0MB. Max. memory is 16.1GB. * Witness Printer took 96.04ms. Allocated memory is still 528.5MB. Free memory was 411.9MB in the beginning and 407.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 9]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 9]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 10]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 10]: 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 1 procedures, 16 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 17.3s, OverallIterations: 9, TraceHistogramMax: 47, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6 mSDsluCounter, 675 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 566 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 872 IncrementalHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 109 mSDtfsCounter, 872 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 609 GetRequests, 346 SyntacticMatches, 31 SemanticMatches, 232 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3592 ImplicationChecksByTransitivity, 5.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=238occurred in iteration=8, InterpolantAutomatonStates: 250, 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, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 14.2s InterpolantComputationTime, 685 NumberOfCodeBlocks, 685 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 881 ConstructedInterpolants, 0 QuantifiedInterpolants, 2687 SizeOfPredicates, 0 NumberOfNonLiveVariables, 487 ConjunctsInSsa, 86 ConjunctsInUnsatCore, 17 InterpolantComputations, 5 PerfectInterpolantSequences, 5405/10190 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 4 specifications checked. All of them hold - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((0 <= res) && (x <= 65535)) && (res <= 15)) || (((0 <= res) && (x <= 2097151)) && (res <= 10))) || (((res <= 13) && (0 <= res)) && (x <= 262143))) || (((0 <= res) && (res <= 9)) && (x <= 4194303))) || (((x <= 16383) && (0 <= res)) && (res <= 17))) || (((0 <= res) && (x <= 7)) && (res <= 2147483629))) || (((x <= 511) && (0 <= res)) && (res <= 22))) || (((x <= 131071) && (0 <= res)) && (res <= 14))) || (((0 <= res) && (x <= 32767)) && (res <= 16))) || (((res <= 2147483628) && (0 <= res)) && (x <= 15))) || (((0 <= res) && (x <= 127)) && (res <= 2147483625))) || (((0 <= res) && (x <= 1023)) && (res <= 21))) || ((res == 0) && (x <= 2147483647))) || (((0 <= res) && (res <= 8)) && (x <= 8388607))) || (((0 <= res) && (x <= 2047)) && (res <= 20))) || (((x <= 4095) && (0 <= res)) && (res <= 19))) || (((0 <= res) && (x <= 31)) && (res <= 2147483627))) || (((0 <= res) && (x <= 255)) && (res <= 2147483624))) || (((0 <= res) && (res <= 2147483631)) && (x <= 1))) || (((0 <= res) && (x <= 268435455)) && (res <= 3))) || (((res <= 12) && (0 <= res)) && (x <= 524287))) || (((x <= 1048575) && (res <= 11)) && (0 <= res))) || (((0 <= res) && (x <= 16777215)) && (res <= 7))) || (((res <= 18) && (0 <= res)) && (x <= 8191))) || (((0 <= res) && (res <= 5)) && (x <= 67108863))) || (((0 <= res) && (res <= 4)) && (x <= 134217727))) || (((0 <= res) && (x <= 3)) && (res <= 2147483630))) || (((0 <= res) && (x <= 536870911)) && (res <= 2))) || (((0 <= res) && (res <= 6)) && (x <= 33554431))) || (((0 <= res) && (res <= 1)) && (x <= 1073741823))) || (((0 <= res) && (res <= 2147483626)) && (x <= 63))) RESULT: Ultimate proved your program to be correct! [2024-11-12 16:50:41,888 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE