./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/divbin_unwindbound5.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/divbin_unwindbound5.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3d0e3bce6f4731d98bf8e5301c405fc62948194b21f76143536933e108212a93 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 11:39:27,987 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 11:39:28,044 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-09 11:39:28,048 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 11:39:28,048 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 11:39:28,088 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 11:39:28,088 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 11:39:28,089 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 11:39:28,089 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 11:39:28,089 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 11:39:28,101 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 11:39:28,101 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 11:39:28,102 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 11:39:28,102 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 11:39:28,102 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 11:39:28,103 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 11:39:28,103 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 11:39:28,103 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 11:39:28,103 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 11:39:28,103 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 11:39:28,104 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 11:39:28,104 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 11:39:28,105 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 11:39:28,105 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 11:39:28,105 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 11:39:28,105 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-09 11:39:28,105 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 11:39:28,106 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 11:39:28,106 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 11:39:28,106 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 11:39:28,106 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 11:39:28,107 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 11:39:28,107 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 11:39:28,107 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 11:39:28,107 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 11:39:28,107 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 11:39:28,108 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 11:39:28,108 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 11:39:28,108 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 11:39:28,108 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 11:39:28,108 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 11:39:28,109 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 11:39:28,109 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 11:39:28,109 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 11:39:28,109 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3d0e3bce6f4731d98bf8e5301c405fc62948194b21f76143536933e108212a93 [2024-11-09 11:39:28,319 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 11:39:28,341 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 11:39:28,343 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 11:39:28,344 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 11:39:28,345 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 11:39:28,346 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/divbin_unwindbound5.i [2024-11-09 11:39:29,684 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 11:39:29,905 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 11:39:29,905 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/divbin_unwindbound5.i [2024-11-09 11:39:29,917 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77d9cd50d/c0c881387fa44f53abaef9c26abd2edd/FLAG681cba5e7 [2024-11-09 11:39:29,928 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77d9cd50d/c0c881387fa44f53abaef9c26abd2edd [2024-11-09 11:39:29,930 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 11:39:29,931 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 11:39:29,932 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 11:39:29,933 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 11:39:29,937 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 11:39:29,938 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:39:29" (1/1) ... [2024-11-09 11:39:29,940 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70375727 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:39:29, skipping insertion in model container [2024-11-09 11:39:29,940 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:39:29" (1/1) ... [2024-11-09 11:39:29,957 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 11:39:30,107 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 11:39:30,114 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 11:39:30,129 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 11:39:30,145 INFO L204 MainTranslator]: Completed translation [2024-11-09 11:39:30,146 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:39:30 WrapperNode [2024-11-09 11:39:30,146 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 11:39:30,147 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 11:39:30,148 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 11:39:30,148 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 11:39:30,154 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:39:30" (1/1) ... [2024-11-09 11:39:30,161 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:39:30" (1/1) ... [2024-11-09 11:39:30,177 INFO L138 Inliner]: procedures = 16, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 66 [2024-11-09 11:39:30,178 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 11:39:30,179 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 11:39:30,179 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 11:39:30,179 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 11:39:30,189 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:39:30" (1/1) ... [2024-11-09 11:39:30,189 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:39:30" (1/1) ... [2024-11-09 11:39:30,191 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:39:30" (1/1) ... [2024-11-09 11:39:30,205 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 11:39:30,206 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:39:30" (1/1) ... [2024-11-09 11:39:30,206 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:39:30" (1/1) ... [2024-11-09 11:39:30,209 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:39:30" (1/1) ... [2024-11-09 11:39:30,213 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:39:30" (1/1) ... [2024-11-09 11:39:30,220 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:39:30" (1/1) ... [2024-11-09 11:39:30,221 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:39:30" (1/1) ... [2024-11-09 11:39:30,223 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 11:39:30,223 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 11:39:30,224 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 11:39:30,224 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 11:39:30,225 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:39:30" (1/1) ... [2024-11-09 11:39:30,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 11:39:30,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:39:30,273 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 11:39:30,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 11:39:30,326 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 11:39:30,327 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 11:39:30,327 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 11:39:30,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 11:39:30,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 11:39:30,327 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 11:39:30,327 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 11:39:30,327 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 11:39:30,388 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 11:39:30,390 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 11:39:30,585 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-09 11:39:30,587 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 11:39:30,604 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 11:39:30,604 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-09 11:39:30,604 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:39:30 BoogieIcfgContainer [2024-11-09 11:39:30,605 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 11:39:30,607 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 11:39:30,607 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 11:39:30,613 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 11:39:30,614 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 11:39:29" (1/3) ... [2024-11-09 11:39:30,614 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17c34cec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:39:30, skipping insertion in model container [2024-11-09 11:39:30,614 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:39:30" (2/3) ... [2024-11-09 11:39:30,618 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17c34cec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:39:30, skipping insertion in model container [2024-11-09 11:39:30,618 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:39:30" (3/3) ... [2024-11-09 11:39:30,619 INFO L112 eAbstractionObserver]: Analyzing ICFG divbin_unwindbound5.i [2024-11-09 11:39:30,650 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 11:39:30,650 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-09 11:39:30,715 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 11:39:30,722 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;@1cee6e97, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 11:39:30,722 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-09 11:39:30,730 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 30 states have internal predecessors, (40), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 11:39:30,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 11:39:30,739 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:39:30,740 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:39:30,740 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-09 11:39:30,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:39:30,747 INFO L85 PathProgramCache]: Analyzing trace with hash -604571617, now seen corresponding path program 1 times [2024-11-09 11:39:30,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:39:30,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140226236] [2024-11-09 11:39:30,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:39:30,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:39:30,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:30,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:39:30,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:30,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:39:30,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:30,887 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:39:30,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:39:30,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140226236] [2024-11-09 11:39:30,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140226236] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:39:30,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:39:30,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 11:39:30,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740985473] [2024-11-09 11:39:30,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:39:30,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 11:39:30,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:39:30,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 11:39:30,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 11:39:30,920 INFO L87 Difference]: Start difference. First operand has 37 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 30 states have internal predecessors, (40), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 11:39:30,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:39:30,937 INFO L93 Difference]: Finished difference Result 70 states and 95 transitions. [2024-11-09 11:39:30,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 11:39:30,942 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 15 [2024-11-09 11:39:30,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:39:30,952 INFO L225 Difference]: With dead ends: 70 [2024-11-09 11:39:30,953 INFO L226 Difference]: Without dead ends: 29 [2024-11-09 11:39:30,956 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 11:39:30,958 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:39:30,959 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:39:30,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-09 11:39:30,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-09 11:39:30,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 20 states have (on average 1.35) internal successors, (27), 23 states have internal predecessors, (27), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 11:39:30,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2024-11-09 11:39:30,987 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 15 [2024-11-09 11:39:30,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:39:30,988 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2024-11-09 11:39:30,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 11:39:30,988 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2024-11-09 11:39:30,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 11:39:30,989 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:39:30,989 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:39:30,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 11:39:30,990 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:39:30,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:39:30,990 INFO L85 PathProgramCache]: Analyzing trace with hash 153751263, now seen corresponding path program 1 times [2024-11-09 11:39:30,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:39:30,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174586515] [2024-11-09 11:39:30,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:39:30,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:39:31,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:31,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:39:31,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:31,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:39:31,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:31,181 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:39:31,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:39:31,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174586515] [2024-11-09 11:39:31,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174586515] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:39:31,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:39:31,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:39:31,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807258195] [2024-11-09 11:39:31,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:39:31,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:39:31,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:39:31,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:39:31,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:39:31,188 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:39:31,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:39:31,242 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2024-11-09 11:39:31,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:39:31,243 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 15 [2024-11-09 11:39:31,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:39:31,244 INFO L225 Difference]: With dead ends: 34 [2024-11-09 11:39:31,244 INFO L226 Difference]: Without dead ends: 33 [2024-11-09 11:39:31,244 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:39:31,245 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 18 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:39:31,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 61 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:39:31,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-09 11:39:31,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2024-11-09 11:39:31,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 20 states have (on average 1.3) internal successors, (26), 22 states have internal predecessors, (26), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 11:39:31,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2024-11-09 11:39:31,250 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 15 [2024-11-09 11:39:31,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:39:31,251 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2024-11-09 11:39:31,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:39:31,251 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2024-11-09 11:39:31,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 11:39:31,252 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:39:31,252 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:39:31,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 11:39:31,252 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:39:31,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:39:31,253 INFO L85 PathProgramCache]: Analyzing trace with hash 471321901, now seen corresponding path program 1 times [2024-11-09 11:39:31,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:39:31,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203462888] [2024-11-09 11:39:31,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:39:31,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:39:31,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:31,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:39:31,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:31,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:39:31,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:31,336 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:39:31,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:39:31,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203462888] [2024-11-09 11:39:31,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203462888] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:39:31,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:39:31,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:39:31,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651193788] [2024-11-09 11:39:31,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:39:31,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:39:31,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:39:31,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:39:31,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:39:31,341 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:39:31,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:39:31,382 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2024-11-09 11:39:31,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 11:39:31,383 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 16 [2024-11-09 11:39:31,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:39:31,384 INFO L225 Difference]: With dead ends: 46 [2024-11-09 11:39:31,384 INFO L226 Difference]: Without dead ends: 32 [2024-11-09 11:39:31,385 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:39:31,385 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 8 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:39:31,387 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 70 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:39:31,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-09 11:39:31,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-09 11:39:31,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.25) internal successors, (30), 26 states have internal predecessors, (30), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 11:39:31,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2024-11-09 11:39:31,392 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 16 [2024-11-09 11:39:31,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:39:31,392 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2024-11-09 11:39:31,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:39:31,392 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2024-11-09 11:39:31,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 11:39:31,393 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:39:31,393 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:39:31,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 11:39:31,393 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:39:31,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:39:31,394 INFO L85 PathProgramCache]: Analyzing trace with hash -2080735310, now seen corresponding path program 1 times [2024-11-09 11:39:31,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:39:31,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478637499] [2024-11-09 11:39:31,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:39:31,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:39:31,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:31,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:39:31,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:31,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:39:31,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:31,528 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:39:31,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:39:31,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478637499] [2024-11-09 11:39:31,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478637499] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:39:31,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:39:31,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 11:39:31,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834927527] [2024-11-09 11:39:31,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:39:31,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 11:39:31,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:39:31,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 11:39:31,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 11:39:31,531 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:39:31,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:39:31,609 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2024-11-09 11:39:31,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 11:39:31,610 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2024-11-09 11:39:31,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:39:31,610 INFO L225 Difference]: With dead ends: 32 [2024-11-09 11:39:31,610 INFO L226 Difference]: Without dead ends: 31 [2024-11-09 11:39:31,611 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-09 11:39:31,612 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 40 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:39:31,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 63 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:39:31,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-09 11:39:31,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-11-09 11:39:31,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 11:39:31,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2024-11-09 11:39:31,616 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 20 [2024-11-09 11:39:31,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:39:31,616 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2024-11-09 11:39:31,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:39:31,617 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2024-11-09 11:39:31,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 11:39:31,617 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:39:31,617 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:39:31,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 11:39:31,618 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-09 11:39:31,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:39:31,618 INFO L85 PathProgramCache]: Analyzing trace with hash -78285105, now seen corresponding path program 1 times [2024-11-09 11:39:31,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:39:31,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350981197] [2024-11-09 11:39:31,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:39:31,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:39:31,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:31,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:39:31,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:31,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:39:31,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:31,696 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:39:31,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:39:31,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350981197] [2024-11-09 11:39:31,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350981197] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:39:31,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:39:31,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 11:39:31,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899554805] [2024-11-09 11:39:31,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:39:31,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 11:39:31,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:39:31,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 11:39:31,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 11:39:31,702 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:39:31,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:39:31,802 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2024-11-09 11:39:31,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 11:39:31,803 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2024-11-09 11:39:31,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:39:31,804 INFO L225 Difference]: With dead ends: 41 [2024-11-09 11:39:31,806 INFO L226 Difference]: Without dead ends: 40 [2024-11-09 11:39:31,806 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-09 11:39:31,807 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 15 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:39:31,807 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 94 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:39:31,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-09 11:39:31,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 35. [2024-11-09 11:39:31,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 29 states have internal predecessors, (34), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 11:39:31,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2024-11-09 11:39:31,820 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 21 [2024-11-09 11:39:31,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:39:31,820 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2024-11-09 11:39:31,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:39:31,820 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2024-11-09 11:39:31,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 11:39:31,821 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:39:31,821 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:39:31,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 11:39:31,821 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:39:31,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:39:31,822 INFO L85 PathProgramCache]: Analyzing trace with hash -78246376, now seen corresponding path program 1 times [2024-11-09 11:39:31,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:39:31,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955349793] [2024-11-09 11:39:31,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:39:31,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:39:31,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:31,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:39:31,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:31,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:39:31,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:31,891 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:39:31,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:39:31,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955349793] [2024-11-09 11:39:31,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955349793] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:39:31,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1152681877] [2024-11-09 11:39:31,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:39:31,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:39:31,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:39:31,895 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:39:31,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 11:39:31,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:31,959 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 11:39:31,963 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:39:32,039 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:39:32,039 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:39:32,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1152681877] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:39:32,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 11:39:32,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2024-11-09 11:39:32,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729152944] [2024-11-09 11:39:32,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:39:32,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:39:32,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:39:32,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:39:32,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-09 11:39:32,041 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:39:32,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:39:32,096 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2024-11-09 11:39:32,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 11:39:32,096 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2024-11-09 11:39:32,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:39:32,097 INFO L225 Difference]: With dead ends: 39 [2024-11-09 11:39:32,097 INFO L226 Difference]: Without dead ends: 38 [2024-11-09 11:39:32,097 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-09 11:39:32,098 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 17 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:39:32,098 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 78 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:39:32,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-09 11:39:32,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2024-11-09 11:39:32,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 11:39:32,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2024-11-09 11:39:32,103 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 21 [2024-11-09 11:39:32,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:39:32,104 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2024-11-09 11:39:32,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:39:32,104 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2024-11-09 11:39:32,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 11:39:32,105 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:39:32,105 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:39:32,119 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 11:39:32,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-09 11:39:32,309 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-09 11:39:32,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:39:32,310 INFO L85 PathProgramCache]: Analyzing trace with hash 654806120, now seen corresponding path program 1 times [2024-11-09 11:39:32,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:39:32,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134188233] [2024-11-09 11:39:32,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:39:32,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:39:32,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:32,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:39:32,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:32,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:39:32,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:32,373 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:39:32,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:39:32,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134188233] [2024-11-09 11:39:32,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134188233] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:39:32,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [870859838] [2024-11-09 11:39:32,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:39:32,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:39:32,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:39:32,379 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:39:32,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 11:39:32,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:32,420 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 11:39:32,421 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:39:32,451 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:39:32,452 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:39:32,501 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:39:32,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [870859838] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:39:32,502 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:39:32,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 10 [2024-11-09 11:39:32,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492789646] [2024-11-09 11:39:32,502 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:39:32,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 11:39:32,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:39:32,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 11:39:32,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-09 11:39:32,504 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-09 11:39:32,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:39:32,582 INFO L93 Difference]: Finished difference Result 68 states and 79 transitions. [2024-11-09 11:39:32,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 11:39:32,582 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 25 [2024-11-09 11:39:32,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:39:32,583 INFO L225 Difference]: With dead ends: 68 [2024-11-09 11:39:32,583 INFO L226 Difference]: Without dead ends: 56 [2024-11-09 11:39:32,583 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2024-11-09 11:39:32,584 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 23 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:39:32,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 105 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:39:32,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-09 11:39:32,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 48. [2024-11-09 11:39:32,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 42 states have internal predecessors, (49), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 11:39:32,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2024-11-09 11:39:32,589 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 25 [2024-11-09 11:39:32,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:39:32,589 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2024-11-09 11:39:32,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-09 11:39:32,590 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2024-11-09 11:39:32,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 11:39:32,590 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:39:32,590 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:39:32,605 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 11:39:32,791 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,SelfDestructingSolverStorable6 [2024-11-09 11:39:32,791 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-09 11:39:32,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:39:32,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1174269756, now seen corresponding path program 1 times [2024-11-09 11:39:32,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:39:32,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071367243] [2024-11-09 11:39:32,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:39:32,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:39:32,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:32,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:39:32,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:32,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:39:32,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:32,885 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:39:32,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:39:32,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071367243] [2024-11-09 11:39:32,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071367243] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:39:32,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326328886] [2024-11-09 11:39:32,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:39:32,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:39:32,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:39:32,890 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:39:32,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 11:39:32,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:32,927 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 11:39:32,928 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:39:32,977 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:39:32,977 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:39:33,059 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:39:33,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [326328886] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:39:33,061 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:39:33,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2024-11-09 11:39:33,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970495377] [2024-11-09 11:39:33,061 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:39:33,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 11:39:33,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:39:33,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 11:39:33,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2024-11-09 11:39:33,062 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand has 18 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 18 states have internal predecessors, (46), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 11:39:33,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:39:33,292 INFO L93 Difference]: Finished difference Result 77 states and 89 transitions. [2024-11-09 11:39:33,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-09 11:39:33,293 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 18 states have internal predecessors, (46), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 26 [2024-11-09 11:39:33,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:39:33,294 INFO L225 Difference]: With dead ends: 77 [2024-11-09 11:39:33,294 INFO L226 Difference]: Without dead ends: 76 [2024-11-09 11:39:33,294 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=259, Invalid=733, Unknown=0, NotChecked=0, Total=992 [2024-11-09 11:39:33,295 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 98 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:39:33,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 147 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:39:33,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-09 11:39:33,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 70. [2024-11-09 11:39:33,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 60 states have (on average 1.15) internal successors, (69), 60 states have internal predecessors, (69), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 11:39:33,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 79 transitions. [2024-11-09 11:39:33,301 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 79 transitions. Word has length 26 [2024-11-09 11:39:33,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:39:33,302 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 79 transitions. [2024-11-09 11:39:33,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 18 states have internal predecessors, (46), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 11:39:33,302 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 79 transitions. [2024-11-09 11:39:33,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-09 11:39:33,303 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:39:33,303 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:39:33,318 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-09 11:39:33,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:39:33,508 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-09 11:39:33,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:39:33,508 INFO L85 PathProgramCache]: Analyzing trace with hash 749470151, now seen corresponding path program 1 times [2024-11-09 11:39:33,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:39:33,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698243462] [2024-11-09 11:39:33,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:39:33,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:39:33,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:33,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:39:33,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:33,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:39:33,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:33,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-09 11:39:33,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:33,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 11:39:33,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:33,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 11:39:33,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:33,687 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-09 11:39:33,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:39:33,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698243462] [2024-11-09 11:39:33,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698243462] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:39:33,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1332883961] [2024-11-09 11:39:33,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:39:33,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:39:33,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:39:33,690 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:39:33,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 11:39:33,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:33,741 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 11:39:33,742 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:39:33,912 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:39:33,912 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:39:34,109 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-09 11:39:34,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1332883961] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:39:34,109 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:39:34,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 29 [2024-11-09 11:39:34,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40366274] [2024-11-09 11:39:34,110 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:39:34,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-09 11:39:34,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:39:34,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-09 11:39:34,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=658, Unknown=0, NotChecked=0, Total=870 [2024-11-09 11:39:34,113 INFO L87 Difference]: Start difference. First operand 70 states and 79 transitions. Second operand has 30 states, 29 states have (on average 3.3448275862068964) internal successors, (97), 30 states have internal predecessors, (97), 11 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-09 11:39:34,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:39:34,684 INFO L93 Difference]: Finished difference Result 223 states and 253 transitions. [2024-11-09 11:39:34,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-11-09 11:39:34,684 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.3448275862068964) internal successors, (97), 30 states have internal predecessors, (97), 11 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) Word has length 54 [2024-11-09 11:39:34,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:39:34,686 INFO L225 Difference]: With dead ends: 223 [2024-11-09 11:39:34,686 INFO L226 Difference]: Without dead ends: 222 [2024-11-09 11:39:34,687 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 599 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=896, Invalid=2296, Unknown=0, NotChecked=0, Total=3192 [2024-11-09 11:39:34,687 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 226 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 11:39:34,688 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 198 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 11:39:34,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-11-09 11:39:34,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 169. [2024-11-09 11:39:34,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 141 states have (on average 1.127659574468085) internal successors, (159), 141 states have internal predecessors, (159), 14 states have call successors, (14), 13 states have call predecessors, (14), 13 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 11:39:34,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 187 transitions. [2024-11-09 11:39:34,711 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 187 transitions. Word has length 54 [2024-11-09 11:39:34,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:39:34,712 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 187 transitions. [2024-11-09 11:39:34,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.3448275862068964) internal successors, (97), 30 states have internal predecessors, (97), 11 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-09 11:39:34,712 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 187 transitions. [2024-11-09 11:39:34,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-09 11:39:34,713 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:39:34,713 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:39:34,741 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 11:39:34,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:39:34,918 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:39:34,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:39:34,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1527022909, now seen corresponding path program 1 times [2024-11-09 11:39:34,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:39:34,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405538180] [2024-11-09 11:39:34,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:39:34,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:39:34,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:35,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:39:35,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:35,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:39:35,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:35,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 11:39:35,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:35,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-09 11:39:35,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:35,157 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-09 11:39:35,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:39:35,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405538180] [2024-11-09 11:39:35,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405538180] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:39:35,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1091177729] [2024-11-09 11:39:35,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:39:35,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:39:35,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:39:35,159 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:39:35,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 11:39:35,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:35,203 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 11:39:35,204 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:39:35,242 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-09 11:39:35,242 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:39:35,366 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-09 11:39:35,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1091177729] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:39:35,367 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:39:35,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 12 [2024-11-09 11:39:35,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49812832] [2024-11-09 11:39:35,367 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:39:35,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 11:39:35,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:39:35,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 11:39:35,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-11-09 11:39:35,368 INFO L87 Difference]: Start difference. First operand 169 states and 187 transitions. Second operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-09 11:39:35,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:39:35,474 INFO L93 Difference]: Finished difference Result 209 states and 231 transitions. [2024-11-09 11:39:35,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 11:39:35,476 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 62 [2024-11-09 11:39:35,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:39:35,477 INFO L225 Difference]: With dead ends: 209 [2024-11-09 11:39:35,477 INFO L226 Difference]: Without dead ends: 183 [2024-11-09 11:39:35,478 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 121 SyntacticMatches, 10 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=149, Invalid=271, Unknown=0, NotChecked=0, Total=420 [2024-11-09 11:39:35,478 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 35 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:39:35,478 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 108 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:39:35,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-09 11:39:35,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 174. [2024-11-09 11:39:35,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 146 states have (on average 1.13013698630137) internal successors, (165), 146 states have internal predecessors, (165), 14 states have call successors, (14), 13 states have call predecessors, (14), 13 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 11:39:35,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 193 transitions. [2024-11-09 11:39:35,496 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 193 transitions. Word has length 62 [2024-11-09 11:39:35,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:39:35,497 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 193 transitions. [2024-11-09 11:39:35,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-09 11:39:35,498 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 193 transitions. [2024-11-09 11:39:35,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-09 11:39:35,500 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:39:35,500 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:39:35,516 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-09 11:39:35,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-09 11:39:35,702 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:39:35,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:39:35,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1636572440, now seen corresponding path program 2 times [2024-11-09 11:39:35,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:39:35,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712479390] [2024-11-09 11:39:35,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:39:35,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:39:35,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:35,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:39:35,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:35,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:39:35,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:35,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-09 11:39:35,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:35,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-09 11:39:35,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:35,769 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2024-11-09 11:39:35,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:39:35,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712479390] [2024-11-09 11:39:35,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712479390] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:39:35,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:39:35,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 11:39:35,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750865390] [2024-11-09 11:39:35,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:39:35,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:39:35,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:39:35,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:39:35,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:39:35,773 INFO L87 Difference]: Start difference. First operand 174 states and 193 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 11:39:35,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:39:35,799 INFO L93 Difference]: Finished difference Result 200 states and 221 transitions. [2024-11-09 11:39:35,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 11:39:35,800 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 67 [2024-11-09 11:39:35,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:39:35,801 INFO L225 Difference]: With dead ends: 200 [2024-11-09 11:39:35,801 INFO L226 Difference]: Without dead ends: 174 [2024-11-09 11:39:35,801 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 11:39:35,802 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 2 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:39:35,802 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 94 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:39:35,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-09 11:39:35,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 155. [2024-11-09 11:39:35,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 127 states have (on average 1.1181102362204725) internal successors, (142), 127 states have internal predecessors, (142), 14 states have call successors, (14), 13 states have call predecessors, (14), 13 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 11:39:35,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 170 transitions. [2024-11-09 11:39:35,821 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 170 transitions. Word has length 67 [2024-11-09 11:39:35,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:39:35,821 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 170 transitions. [2024-11-09 11:39:35,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 11:39:35,822 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 170 transitions. [2024-11-09 11:39:35,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-09 11:39:35,825 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:39:35,825 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:39:35,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 11:39:35,826 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:39:35,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:39:35,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1694985668, now seen corresponding path program 1 times [2024-11-09 11:39:35,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:39:35,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787609092] [2024-11-09 11:39:35,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:39:35,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:39:35,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:35,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:39:35,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:35,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:39:36,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:36,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 11:39:36,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:36,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 11:39:36,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:36,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 11:39:36,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:36,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 11:39:36,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:36,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 11:39:36,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:36,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 11:39:36,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:36,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-09 11:39:36,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:36,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 11:39:36,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:36,021 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 90 proven. 7 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2024-11-09 11:39:36,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:39:36,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787609092] [2024-11-09 11:39:36,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787609092] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:39:36,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2000350946] [2024-11-09 11:39:36,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:39:36,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:39:36,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:39:36,027 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:39:36,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 11:39:36,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:36,108 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 11:39:36,111 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:39:36,312 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 228 proven. 3 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-09 11:39:36,312 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:39:36,613 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 156 proven. 3 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2024-11-09 11:39:36,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2000350946] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:39:36,613 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:39:36,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 13, 14] total 19 [2024-11-09 11:39:36,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619026012] [2024-11-09 11:39:36,614 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:39:36,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-09 11:39:36,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:39:36,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-09 11:39:36,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2024-11-09 11:39:36,615 INFO L87 Difference]: Start difference. First operand 155 states and 170 transitions. Second operand has 19 states, 19 states have (on average 4.7894736842105265) internal successors, (91), 19 states have internal predecessors, (91), 8 states have call successors, (17), 6 states have call predecessors, (17), 6 states have return successors, (17), 8 states have call predecessors, (17), 8 states have call successors, (17) [2024-11-09 11:39:37,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:39:37,058 INFO L93 Difference]: Finished difference Result 249 states and 273 transitions. [2024-11-09 11:39:37,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-09 11:39:37,059 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.7894736842105265) internal successors, (91), 19 states have internal predecessors, (91), 8 states have call successors, (17), 6 states have call predecessors, (17), 6 states have return successors, (17), 8 states have call predecessors, (17), 8 states have call successors, (17) Word has length 114 [2024-11-09 11:39:37,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:39:37,059 INFO L225 Difference]: With dead ends: 249 [2024-11-09 11:39:37,059 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 11:39:37,061 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 228 SyntacticMatches, 11 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=318, Invalid=1164, Unknown=0, NotChecked=0, Total=1482 [2024-11-09 11:39:37,062 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 62 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 11:39:37,062 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 358 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 11:39:37,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 11:39:37,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 11:39:37,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:39:37,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 11:39:37,063 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 114 [2024-11-09 11:39:37,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:39:37,063 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 11:39:37,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.7894736842105265) internal successors, (91), 19 states have internal predecessors, (91), 8 states have call successors, (17), 6 states have call predecessors, (17), 6 states have return successors, (17), 8 states have call predecessors, (17), 8 states have call successors, (17) [2024-11-09 11:39:37,063 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 11:39:37,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 11:39:37,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-11-09 11:39:37,067 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-11-09 11:39:37,067 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-11-09 11:39:37,067 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-11-09 11:39:37,087 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-09 11:39:37,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:39:37,271 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:39:37,274 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-09 11:39:37,500 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 11:39:37,548 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 11:39:37 BoogieIcfgContainer [2024-11-09 11:39:37,549 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 11:39:37,549 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 11:39:37,549 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 11:39:37,549 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 11:39:37,550 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:39:30" (3/4) ... [2024-11-09 11:39:37,552 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-09 11:39:37,556 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-09 11:39:37,556 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-11-09 11:39:37,559 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-11-09 11:39:37,560 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-09 11:39:37,560 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 11:39:37,560 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 11:39:37,633 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 11:39:37,633 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 11:39:37,634 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 11:39:37,634 INFO L158 Benchmark]: Toolchain (without parser) took 7702.79ms. Allocated memory was 192.9MB in the beginning and 232.8MB in the end (delta: 39.8MB). Free memory was 162.5MB in the beginning and 77.2MB in the end (delta: 85.4MB). Peak memory consumption was 124.2MB. Max. memory is 16.1GB. [2024-11-09 11:39:37,634 INFO L158 Benchmark]: CDTParser took 0.97ms. Allocated memory is still 138.4MB. Free memory was 101.8MB in the beginning and 101.6MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 11:39:37,635 INFO L158 Benchmark]: CACSL2BoogieTranslator took 214.33ms. Allocated memory is still 192.9MB. Free memory was 162.3MB in the beginning and 154.6MB in the end (delta: 7.8MB). Peak memory consumption was 9.0MB. Max. memory is 16.1GB. [2024-11-09 11:39:37,635 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.83ms. Allocated memory is still 192.9MB. Free memory was 154.6MB in the beginning and 153.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 11:39:37,635 INFO L158 Benchmark]: Boogie Preprocessor took 43.83ms. Allocated memory is still 192.9MB. Free memory was 153.5MB in the beginning and 151.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 11:39:37,635 INFO L158 Benchmark]: RCFGBuilder took 381.13ms. Allocated memory is still 192.9MB. Free memory was 151.4MB in the beginning and 138.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 11:39:37,635 INFO L158 Benchmark]: TraceAbstraction took 6941.62ms. Allocated memory was 192.9MB in the beginning and 232.8MB in the end (delta: 39.8MB). Free memory was 138.8MB in the beginning and 82.4MB in the end (delta: 56.4MB). Peak memory consumption was 96.3MB. Max. memory is 16.1GB. [2024-11-09 11:39:37,636 INFO L158 Benchmark]: Witness Printer took 84.47ms. Allocated memory is still 232.8MB. Free memory was 81.4MB in the beginning and 77.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 11:39:37,637 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.97ms. Allocated memory is still 138.4MB. Free memory was 101.8MB in the beginning and 101.6MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 214.33ms. Allocated memory is still 192.9MB. Free memory was 162.3MB in the beginning and 154.6MB in the end (delta: 7.8MB). Peak memory consumption was 9.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.83ms. Allocated memory is still 192.9MB. Free memory was 154.6MB in the beginning and 153.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.83ms. Allocated memory is still 192.9MB. Free memory was 153.5MB in the beginning and 151.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 381.13ms. Allocated memory is still 192.9MB. Free memory was 151.4MB in the beginning and 138.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 6941.62ms. Allocated memory was 192.9MB in the beginning and 232.8MB in the end (delta: 39.8MB). Free memory was 138.8MB in the beginning and 82.4MB in the end (delta: 56.4MB). Peak memory consumption was 96.3MB. Max. memory is 16.1GB. * Witness Printer took 84.47ms. Allocated memory is still 232.8MB. Free memory was 81.4MB in the beginning and 77.2MB 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: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: 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 3 procedures, 37 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 6.6s, OverallIterations: 12, TraceHistogramMax: 9, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 544 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 544 mSDsluCounter, 1418 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1089 mSDsCounter, 55 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 867 IncrementalHoareTripleChecker+Invalid, 922 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 55 mSolverCounterUnsat, 329 mSDtfsCounter, 867 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 805 GetRequests, 595 SyntacticMatches, 21 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1245 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=174occurred in iteration=10, InterpolantAutomatonStates: 158, 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, 12 MinimizatonAttempts, 109 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 758 NumberOfCodeBlocks, 758 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1016 ConstructedInterpolants, 0 QuantifiedInterpolants, 1920 SizeOfPredicates, 34 NumberOfNonLiveVariables, 744 ConjunctsInSsa, 49 ConjunctsInUnsatCore, 23 InterpolantComputations, 7 PerfectInterpolantSequences, 1261/1538 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: 40]: Loop Invariant Derived loop invariant: ((((counter <= 5) && (3 <= counter)) || ((6 <= counter) && (counter <= 2147483645))) || ((counter <= 3) && (1 <= counter))) - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: ((counter == 0) || (((counter == 5) || (counter < 5)) && (1 <= counter))) - ProcedureContractResult [Line: 15]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: (counter == 0) Ensures: ((counter == 0) && (counter == \old(counter))) - ProcedureContractResult [Line: 18]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Ensures: (counter == \old(counter)) RESULT: Ultimate proved your program to be correct! [2024-11-09 11:39:37,677 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