./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/mannadiv_unwindbound1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/mannadiv_unwindbound1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e62f050c54efcaebe70ca4fab804a982fed550b56ad5b495e4ea54f0b2b8135b --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 20:56:45,836 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 20:56:45,909 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-14 20:56:45,914 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 20:56:45,916 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 20:56:45,944 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 20:56:45,946 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 20:56:45,946 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 20:56:45,947 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 20:56:45,949 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 20:56:45,949 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 20:56:45,950 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 20:56:45,950 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 20:56:45,951 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 20:56:45,951 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 20:56:45,951 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 20:56:45,952 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 20:56:45,952 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 20:56:45,952 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 20:56:45,952 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 20:56:45,953 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 20:56:45,956 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 20:56:45,956 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 20:56:45,956 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 20:56:45,957 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 20:56:45,957 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-14 20:56:45,957 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 20:56:45,958 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 20:56:45,958 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 20:56:45,958 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 20:56:45,959 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 20:56:45,959 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 20:56:45,959 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 20:56:45,960 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 20:56:45,960 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 20:56:45,960 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 20:56:45,961 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 20:56:45,961 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 20:56:45,961 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 20:56:45,961 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 20:56:45,962 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 20:56:45,962 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 20:56:45,962 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 20:56:45,962 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 20:56:45,963 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 -> e62f050c54efcaebe70ca4fab804a982fed550b56ad5b495e4ea54f0b2b8135b [2024-10-14 20:56:46,236 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 20:56:46,263 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 20:56:46,266 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 20:56:46,267 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 20:56:46,268 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 20:56:46,269 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/mannadiv_unwindbound1.c [2024-10-14 20:56:47,711 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 20:56:47,925 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 20:56:47,925 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/mannadiv_unwindbound1.c [2024-10-14 20:56:47,932 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/127cf52f5/59ffd62c0d48460baa37e00e00d9e0c1/FLAGac11be603 [2024-10-14 20:56:48,301 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/127cf52f5/59ffd62c0d48460baa37e00e00d9e0c1 [2024-10-14 20:56:48,304 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 20:56:48,305 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 20:56:48,307 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 20:56:48,307 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 20:56:48,312 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 20:56:48,312 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 08:56:48" (1/1) ... [2024-10-14 20:56:48,313 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14154ecb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:56:48, skipping insertion in model container [2024-10-14 20:56:48,313 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 08:56:48" (1/1) ... [2024-10-14 20:56:48,332 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 20:56:48,515 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 20:56:48,530 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 20:56:48,545 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 20:56:48,562 INFO L204 MainTranslator]: Completed translation [2024-10-14 20:56:48,562 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:56:48 WrapperNode [2024-10-14 20:56:48,562 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 20:56:48,564 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 20:56:48,564 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 20:56:48,564 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 20:56:48,573 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:56:48" (1/1) ... [2024-10-14 20:56:48,580 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:56:48" (1/1) ... [2024-10-14 20:56:48,605 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 76 [2024-10-14 20:56:48,605 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 20:56:48,606 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 20:56:48,606 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 20:56:48,606 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 20:56:48,615 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:56:48" (1/1) ... [2024-10-14 20:56:48,616 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:56:48" (1/1) ... [2024-10-14 20:56:48,617 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:56:48" (1/1) ... [2024-10-14 20:56:48,636 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-10-14 20:56:48,636 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:56:48" (1/1) ... [2024-10-14 20:56:48,637 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:56:48" (1/1) ... [2024-10-14 20:56:48,639 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:56:48" (1/1) ... [2024-10-14 20:56:48,643 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:56:48" (1/1) ... [2024-10-14 20:56:48,644 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:56:48" (1/1) ... [2024-10-14 20:56:48,649 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:56:48" (1/1) ... [2024-10-14 20:56:48,651 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 20:56:48,652 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 20:56:48,652 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 20:56:48,652 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 20:56:48,653 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:56:48" (1/1) ... [2024-10-14 20:56:48,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 20:56:48,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:56:48,707 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 20:56:48,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 20:56:48,766 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 20:56:48,766 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 20:56:48,766 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 20:56:48,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 20:56:48,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 20:56:48,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 20:56:48,767 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-14 20:56:48,767 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-14 20:56:48,833 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 20:56:48,837 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 20:56:49,120 INFO L? ?]: Removed 47 outVars from TransFormulas that were not future-live. [2024-10-14 20:56:49,120 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 20:56:49,160 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 20:56:49,162 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 20:56:49,163 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:56:49 BoogieIcfgContainer [2024-10-14 20:56:49,163 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 20:56:49,165 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 20:56:49,165 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 20:56:49,169 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 20:56:49,169 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 08:56:48" (1/3) ... [2024-10-14 20:56:49,170 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7149422 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 08:56:49, skipping insertion in model container [2024-10-14 20:56:49,170 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:56:48" (2/3) ... [2024-10-14 20:56:49,171 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7149422 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 08:56:49, skipping insertion in model container [2024-10-14 20:56:49,171 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:56:49" (3/3) ... [2024-10-14 20:56:49,172 INFO L112 eAbstractionObserver]: Analyzing ICFG mannadiv_unwindbound1.c [2024-10-14 20:56:49,189 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 20:56:49,189 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 22 error locations. [2024-10-14 20:56:49,268 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 20:56:49,276 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;@21627410, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 20:56:49,277 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2024-10-14 20:56:49,281 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 35 states have (on average 1.8) internal successors, (63), 57 states have internal predecessors, (63), 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-10-14 20:56:49,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-14 20:56:49,288 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:56:49,289 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:56:49,290 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 20:56:49,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:56:49,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1616721719, now seen corresponding path program 1 times [2024-10-14 20:56:49,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:56:49,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999522456] [2024-10-14 20:56:49,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:56:49,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:56:49,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:49,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 20:56:49,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:49,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 20:56:49,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:49,451 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 20:56:49,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:56:49,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999522456] [2024-10-14 20:56:49,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999522456] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:56:49,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:56:49,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 20:56:49,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125297840] [2024-10-14 20:56:49,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:56:49,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 20:56:49,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:56:49,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 20:56:49,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 20:56:49,484 INFO L87 Difference]: Start difference. First operand has 64 states, 35 states have (on average 1.8) internal successors, (63), 57 states have internal predecessors, (63), 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 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-10-14 20:56:49,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:56:49,520 INFO L93 Difference]: Finished difference Result 126 states and 143 transitions. [2024-10-14 20:56:49,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 20:56:49,523 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 14 [2024-10-14 20:56:49,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:56:49,530 INFO L225 Difference]: With dead ends: 126 [2024-10-14 20:56:49,530 INFO L226 Difference]: Without dead ends: 61 [2024-10-14 20:56:49,534 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-10-14 20:56:49,537 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:56:49,538 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:56:49,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-10-14 20:56:49,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-10-14 20:56:49,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 55 states have internal predecessors, (58), 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-10-14 20:56:49,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2024-10-14 20:56:49,593 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 14 [2024-10-14 20:56:49,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:56:49,604 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2024-10-14 20:56:49,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-10-14 20:56:49,605 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2024-10-14 20:56:49,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-14 20:56:49,606 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:56:49,606 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:56:49,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 20:56:49,607 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 20:56:49,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:56:49,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1919924458, now seen corresponding path program 1 times [2024-10-14 20:56:49,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:56:49,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861861072] [2024-10-14 20:56:49,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:56:49,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:56:49,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:49,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 20:56:49,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:49,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 20:56:49,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:49,808 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 20:56:49,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:56:49,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861861072] [2024-10-14 20:56:49,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861861072] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:56:49,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:56:49,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 20:56:49,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572709979] [2024-10-14 20:56:49,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:56:49,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 20:56:49,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:56:49,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 20:56:49,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 20:56:49,815 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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-10-14 20:56:49,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:56:49,877 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2024-10-14 20:56:49,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 20:56:49,878 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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 14 [2024-10-14 20:56:49,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:56:49,879 INFO L225 Difference]: With dead ends: 75 [2024-10-14 20:56:49,879 INFO L226 Difference]: Without dead ends: 65 [2024-10-14 20:56:49,880 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-10-14 20:56:49,882 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 9 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:56:49,883 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 167 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:56:49,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-10-14 20:56:49,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-10-14 20:56:49,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 38 states have (on average 1.631578947368421) internal successors, (62), 59 states have internal predecessors, (62), 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-10-14 20:56:49,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2024-10-14 20:56:49,894 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 14 [2024-10-14 20:56:49,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:56:49,895 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2024-10-14 20:56:49,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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-10-14 20:56:49,896 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2024-10-14 20:56:49,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-14 20:56:49,896 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:56:49,896 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:56:49,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 20:56:49,897 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 20:56:49,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:56:49,897 INFO L85 PathProgramCache]: Analyzing trace with hash -390003592, now seen corresponding path program 1 times [2024-10-14 20:56:49,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:56:49,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197933327] [2024-10-14 20:56:49,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:56:49,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:56:49,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 20:56:49,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [382043451] [2024-10-14 20:56:49,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:56:49,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:56:49,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:56:49,918 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 20:56:49,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 20:56:49,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:49,980 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 20:56:49,988 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:56:50,013 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 20:56:50,013 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 20:56:50,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:56:50,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197933327] [2024-10-14 20:56:50,015 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 20:56:50,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [382043451] [2024-10-14 20:56:50,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [382043451] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:56:50,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:56:50,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 20:56:50,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675725938] [2024-10-14 20:56:50,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:56:50,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 20:56:50,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:56:50,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 20:56:50,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:56:50,017 INFO L87 Difference]: Start difference. First operand 65 states and 68 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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-10-14 20:56:50,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:56:50,110 INFO L93 Difference]: Finished difference Result 104 states and 116 transitions. [2024-10-14 20:56:50,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 20:56:50,111 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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 17 [2024-10-14 20:56:50,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:56:50,112 INFO L225 Difference]: With dead ends: 104 [2024-10-14 20:56:50,112 INFO L226 Difference]: Without dead ends: 98 [2024-10-14 20:56:50,113 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:56:50,114 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 29 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:56:50,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 85 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:56:50,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-14 20:56:50,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 88. [2024-10-14 20:56:50,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 60 states have (on average 1.65) internal successors, (99), 81 states have internal predecessors, (99), 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-10-14 20:56:50,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 107 transitions. [2024-10-14 20:56:50,125 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 107 transitions. Word has length 17 [2024-10-14 20:56:50,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:56:50,125 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 107 transitions. [2024-10-14 20:56:50,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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-10-14 20:56:50,126 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 107 transitions. [2024-10-14 20:56:50,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-14 20:56:50,126 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:56:50,126 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:56:50,139 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 20:56:50,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:56:50,327 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 20:56:50,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:56:50,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1131295462, now seen corresponding path program 1 times [2024-10-14 20:56:50,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:56:50,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839515871] [2024-10-14 20:56:50,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:56:50,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:56:50,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:50,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 20:56:50,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:50,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 20:56:50,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:50,429 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 20:56:50,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:56:50,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839515871] [2024-10-14 20:56:50,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839515871] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:56:50,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:56:50,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 20:56:50,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769689540] [2024-10-14 20:56:50,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:56:50,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 20:56:50,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:56:50,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 20:56:50,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 20:56:50,432 INFO L87 Difference]: Start difference. First operand 88 states and 107 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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-10-14 20:56:50,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:56:50,665 INFO L93 Difference]: Finished difference Result 138 states and 175 transitions. [2024-10-14 20:56:50,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 20:56:50,666 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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 19 [2024-10-14 20:56:50,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:56:50,668 INFO L225 Difference]: With dead ends: 138 [2024-10-14 20:56:50,668 INFO L226 Difference]: Without dead ends: 131 [2024-10-14 20:56:50,669 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 20:56:50,672 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 28 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 20:56:50,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 117 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 20:56:50,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-10-14 20:56:50,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 124. [2024-10-14 20:56:50,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 94 states have (on average 1.5957446808510638) internal successors, (150), 115 states have internal predecessors, (150), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 20:56:50,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 162 transitions. [2024-10-14 20:56:50,703 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 162 transitions. Word has length 19 [2024-10-14 20:56:50,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:56:50,703 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 162 transitions. [2024-10-14 20:56:50,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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-10-14 20:56:50,704 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 162 transitions. [2024-10-14 20:56:50,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-14 20:56:50,704 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:56:50,704 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:56:50,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 20:56:50,704 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 20:56:50,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:56:50,705 INFO L85 PathProgramCache]: Analyzing trace with hash -710420897, now seen corresponding path program 1 times [2024-10-14 20:56:50,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:56:50,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984124516] [2024-10-14 20:56:50,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:56:50,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:56:50,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:50,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 20:56:50,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:50,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 20:56:50,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:50,868 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 20:56:50,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:56:50,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984124516] [2024-10-14 20:56:50,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984124516] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:56:50,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:56:50,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 20:56:50,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661644117] [2024-10-14 20:56:50,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:56:50,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 20:56:50,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:56:50,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 20:56:50,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 20:56:50,871 INFO L87 Difference]: Start difference. First operand 124 states and 162 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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-10-14 20:56:51,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:56:51,098 INFO L93 Difference]: Finished difference Result 135 states and 165 transitions. [2024-10-14 20:56:51,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 20:56:51,098 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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-10-14 20:56:51,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:56:51,101 INFO L225 Difference]: With dead ends: 135 [2024-10-14 20:56:51,102 INFO L226 Difference]: Without dead ends: 126 [2024-10-14 20:56:51,102 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 20:56:51,103 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 42 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 20:56:51,104 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 96 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 20:56:51,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-10-14 20:56:51,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 120. [2024-10-14 20:56:51,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 90 states have (on average 1.5666666666666667) internal successors, (141), 111 states have internal predecessors, (141), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 20:56:51,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 153 transitions. [2024-10-14 20:56:51,124 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 153 transitions. Word has length 20 [2024-10-14 20:56:51,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:56:51,124 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 153 transitions. [2024-10-14 20:56:51,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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-10-14 20:56:51,125 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 153 transitions. [2024-10-14 20:56:51,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-14 20:56:51,125 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:56:51,125 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:56:51,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 20:56:51,126 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 20:56:51,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:56:51,127 INFO L85 PathProgramCache]: Analyzing trace with hash -548211268, now seen corresponding path program 1 times [2024-10-14 20:56:51,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:56:51,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910018826] [2024-10-14 20:56:51,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:56:51,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:56:51,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:51,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 20:56:51,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:51,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 20:56:51,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:51,364 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 20:56:51,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:56:51,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910018826] [2024-10-14 20:56:51,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910018826] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:56:51,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [402184655] [2024-10-14 20:56:51,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:56:51,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:56:51,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:56:51,370 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 20:56:51,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 20:56:51,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:51,420 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 20:56:51,421 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:56:51,586 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 20:56:51,587 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 20:56:51,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [402184655] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:56:51,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 20:56:51,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2024-10-14 20:56:51,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173313335] [2024-10-14 20:56:51,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:56:51,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 20:56:51,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:56:51,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 20:56:51,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-14 20:56:51,590 INFO L87 Difference]: Start difference. First operand 120 states and 153 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 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-10-14 20:56:51,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:56:51,755 INFO L93 Difference]: Finished difference Result 123 states and 157 transitions. [2024-10-14 20:56:51,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 20:56:51,756 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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-10-14 20:56:51,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:56:51,758 INFO L225 Difference]: With dead ends: 123 [2024-10-14 20:56:51,758 INFO L226 Difference]: Without dead ends: 122 [2024-10-14 20:56:51,759 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-10-14 20:56:51,760 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 81 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:56:51,760 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 72 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:56:51,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-10-14 20:56:51,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2024-10-14 20:56:51,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 90 states have (on average 1.5555555555555556) internal successors, (140), 111 states have internal predecessors, (140), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 20:56:51,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 152 transitions. [2024-10-14 20:56:51,771 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 152 transitions. Word has length 21 [2024-10-14 20:56:51,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:56:51,772 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 152 transitions. [2024-10-14 20:56:51,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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-10-14 20:56:51,772 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 152 transitions. [2024-10-14 20:56:51,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-14 20:56:51,773 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:56:51,773 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:56:51,791 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 20:56:51,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-14 20:56:51,978 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 20:56:51,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:56:51,978 INFO L85 PathProgramCache]: Analyzing trace with hash 185319937, now seen corresponding path program 1 times [2024-10-14 20:56:51,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:56:51,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208018621] [2024-10-14 20:56:51,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:56:51,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:56:51,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 20:56:51,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1893598479] [2024-10-14 20:56:51,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:56:51,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:56:51,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:56:51,995 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 20:56:51,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 20:56:52,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:52,046 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 20:56:52,047 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:56:52,155 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 20:56:52,156 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 20:56:52,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:56:52,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208018621] [2024-10-14 20:56:52,156 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 20:56:52,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1893598479] [2024-10-14 20:56:52,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1893598479] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:56:52,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:56:52,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 20:56:52,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965405436] [2024-10-14 20:56:52,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:56:52,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 20:56:52,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:56:52,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 20:56:52,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 20:56:52,159 INFO L87 Difference]: Start difference. First operand 120 states and 152 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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-10-14 20:56:52,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:56:52,288 INFO L93 Difference]: Finished difference Result 121 states and 152 transitions. [2024-10-14 20:56:52,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 20:56:52,289 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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 22 [2024-10-14 20:56:52,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:56:52,290 INFO L225 Difference]: With dead ends: 121 [2024-10-14 20:56:52,290 INFO L226 Difference]: Without dead ends: 120 [2024-10-14 20:56:52,291 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 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-10-14 20:56:52,292 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 74 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:56:52,292 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 77 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:56:52,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-10-14 20:56:52,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-10-14 20:56:52,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 90 states have (on average 1.5444444444444445) internal successors, (139), 111 states have internal predecessors, (139), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 20:56:52,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 151 transitions. [2024-10-14 20:56:52,309 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 151 transitions. Word has length 22 [2024-10-14 20:56:52,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:56:52,309 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 151 transitions. [2024-10-14 20:56:52,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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-10-14 20:56:52,310 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 151 transitions. [2024-10-14 20:56:52,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-14 20:56:52,311 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:56:52,311 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:56:52,334 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-10-14 20:56:52,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:56:52,512 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 20:56:52,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:56:52,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1256432811, now seen corresponding path program 1 times [2024-10-14 20:56:52,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:56:52,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673289172] [2024-10-14 20:56:52,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:56:52,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:56:52,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:52,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 20:56:52,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:52,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 20:56:52,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:52,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-14 20:56:52,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:52,657 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 20:56:52,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:56:52,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673289172] [2024-10-14 20:56:52,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673289172] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:56:52,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1651345920] [2024-10-14 20:56:52,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:56:52,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:56:52,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:56:52,663 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 20:56:52,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-14 20:56:52,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:52,710 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 20:56:52,711 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:56:52,775 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 20:56:52,776 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 20:56:52,886 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 20:56:52,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1651345920] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 20:56:52,887 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 20:56:52,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-10-14 20:56:52,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622765747] [2024-10-14 20:56:52,890 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 20:56:52,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 20:56:52,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:56:52,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 20:56:52,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-14 20:56:52,892 INFO L87 Difference]: Start difference. First operand 120 states and 151 transitions. Second operand has 9 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-14 20:56:53,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:56:53,026 INFO L93 Difference]: Finished difference Result 191 states and 238 transitions. [2024-10-14 20:56:53,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 20:56:53,026 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 34 [2024-10-14 20:56:53,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:56:53,028 INFO L225 Difference]: With dead ends: 191 [2024-10-14 20:56:53,028 INFO L226 Difference]: Without dead ends: 189 [2024-10-14 20:56:53,028 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-10-14 20:56:53,029 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 150 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:56:53,029 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 239 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:56:53,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-10-14 20:56:53,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 167. [2024-10-14 20:56:53,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 135 states have (on average 1.548148148148148) internal successors, (209), 156 states have internal predecessors, (209), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-14 20:56:53,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 225 transitions. [2024-10-14 20:56:53,054 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 225 transitions. Word has length 34 [2024-10-14 20:56:53,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:56:53,055 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 225 transitions. [2024-10-14 20:56:53,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-14 20:56:53,055 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 225 transitions. [2024-10-14 20:56:53,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-14 20:56:53,056 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:56:53,056 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:56:53,073 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-14 20:56:53,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:56:53,257 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 20:56:53,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:56:53,258 INFO L85 PathProgramCache]: Analyzing trace with hash -294711385, now seen corresponding path program 1 times [2024-10-14 20:56:53,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:56:53,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448987927] [2024-10-14 20:56:53,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:56:53,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:56:53,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:53,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 20:56:53,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:53,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 20:56:53,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:53,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-14 20:56:53,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:53,333 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 20:56:53,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:56:53,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448987927] [2024-10-14 20:56:53,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448987927] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:56:53,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:56:53,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 20:56:53,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474454177] [2024-10-14 20:56:53,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:56:53,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 20:56:53,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:56:53,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 20:56:53,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 20:56:53,338 INFO L87 Difference]: Start difference. First operand 167 states and 225 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 20:56:53,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:56:53,382 INFO L93 Difference]: Finished difference Result 177 states and 234 transitions. [2024-10-14 20:56:53,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 20:56:53,383 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 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 35 [2024-10-14 20:56:53,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:56:53,384 INFO L225 Difference]: With dead ends: 177 [2024-10-14 20:56:53,384 INFO L226 Difference]: Without dead ends: 175 [2024-10-14 20:56:53,385 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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-10-14 20:56:53,385 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 80 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:56:53,385 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 75 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:56:53,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-10-14 20:56:53,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 165. [2024-10-14 20:56:53,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 135 states have (on average 1.511111111111111) internal successors, (204), 154 states have internal predecessors, (204), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-14 20:56:53,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 220 transitions. [2024-10-14 20:56:53,403 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 220 transitions. Word has length 35 [2024-10-14 20:56:53,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:56:53,403 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 220 transitions. [2024-10-14 20:56:53,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 20:56:53,404 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 220 transitions. [2024-10-14 20:56:53,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-14 20:56:53,405 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:56:53,406 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:56:53,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 20:56:53,406 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 20:56:53,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:56:53,407 INFO L85 PathProgramCache]: Analyzing trace with hash 250201833, now seen corresponding path program 1 times [2024-10-14 20:56:53,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:56:53,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071330335] [2024-10-14 20:56:53,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:56:53,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:56:53,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:53,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 20:56:53,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:53,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 20:56:53,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:53,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-14 20:56:53,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:53,531 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 20:56:53,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:56:53,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071330335] [2024-10-14 20:56:53,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071330335] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:56:53,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [758123939] [2024-10-14 20:56:53,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:56:53,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:56:53,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:56:53,537 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 20:56:53,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-14 20:56:53,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:53,586 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 20:56:53,587 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:56:53,658 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 20:56:53,659 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 20:56:53,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [758123939] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:56:53,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 20:56:53,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2024-10-14 20:56:53,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441186011] [2024-10-14 20:56:53,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:56:53,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 20:56:53,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:56:53,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 20:56:53,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-14 20:56:53,663 INFO L87 Difference]: Start difference. First operand 165 states and 220 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 20:56:53,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:56:53,695 INFO L93 Difference]: Finished difference Result 165 states and 220 transitions. [2024-10-14 20:56:53,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 20:56:53,696 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2024-10-14 20:56:53,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:56:53,698 INFO L225 Difference]: With dead ends: 165 [2024-10-14 20:56:53,698 INFO L226 Difference]: Without dead ends: 164 [2024-10-14 20:56:53,699 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-14 20:56:53,700 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 42 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:56:53,701 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 108 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:56:53,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-10-14 20:56:53,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2024-10-14 20:56:53,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 135 states have (on average 1.474074074074074) internal successors, (199), 153 states have internal predecessors, (199), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-14 20:56:53,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 215 transitions. [2024-10-14 20:56:53,717 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 215 transitions. Word has length 37 [2024-10-14 20:56:53,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:56:53,718 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 215 transitions. [2024-10-14 20:56:53,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 20:56:53,718 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 215 transitions. [2024-10-14 20:56:53,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-14 20:56:53,721 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:56:53,721 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:56:53,742 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-10-14 20:56:53,921 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-10-14 20:56:53,922 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 20:56:53,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:56:53,922 INFO L85 PathProgramCache]: Analyzing trace with hash -833677725, now seen corresponding path program 1 times [2024-10-14 20:56:53,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:56:53,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645255968] [2024-10-14 20:56:53,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:56:53,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:56:53,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:54,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 20:56:54,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:54,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 20:56:54,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:54,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-14 20:56:54,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:54,032 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 20:56:54,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:56:54,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645255968] [2024-10-14 20:56:54,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645255968] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:56:54,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1191235835] [2024-10-14 20:56:54,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:56:54,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:56:54,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:56:54,036 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 20:56:54,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-14 20:56:54,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:54,084 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 20:56:54,085 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:56:54,137 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 20:56:54,137 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 20:56:54,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1191235835] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:56:54,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 20:56:54,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2024-10-14 20:56:54,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615090291] [2024-10-14 20:56:54,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:56:54,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 20:56:54,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:56:54,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 20:56:54,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-14 20:56:54,139 INFO L87 Difference]: Start difference. First operand 164 states and 215 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 20:56:54,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:56:54,197 INFO L93 Difference]: Finished difference Result 174 states and 224 transitions. [2024-10-14 20:56:54,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 20:56:54,197 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 38 [2024-10-14 20:56:54,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:56:54,199 INFO L225 Difference]: With dead ends: 174 [2024-10-14 20:56:54,199 INFO L226 Difference]: Without dead ends: 173 [2024-10-14 20:56:54,199 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-10-14 20:56:54,200 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 39 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:56:54,200 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 184 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:56:54,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-10-14 20:56:54,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 163. [2024-10-14 20:56:54,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 135 states have (on average 1.4370370370370371) internal successors, (194), 152 states have internal predecessors, (194), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-14 20:56:54,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 210 transitions. [2024-10-14 20:56:54,210 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 210 transitions. Word has length 38 [2024-10-14 20:56:54,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:56:54,210 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 210 transitions. [2024-10-14 20:56:54,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 20:56:54,211 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 210 transitions. [2024-10-14 20:56:54,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-14 20:56:54,212 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:56:54,212 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:56:54,229 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-14 20:56:54,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:56:54,413 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 20:56:54,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:56:54,414 INFO L85 PathProgramCache]: Analyzing trace with hash -260192512, now seen corresponding path program 1 times [2024-10-14 20:56:54,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:56:54,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228486444] [2024-10-14 20:56:54,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:56:54,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:56:54,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 20:56:54,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1695044312] [2024-10-14 20:56:54,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:56:54,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:56:54,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:56:54,427 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 20:56:54,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-14 20:56:54,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:54,470 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 20:56:54,472 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:56:54,648 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 20:56:54,649 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 20:56:54,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:56:54,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228486444] [2024-10-14 20:56:54,844 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 20:56:54,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1695044312] [2024-10-14 20:56:54,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1695044312] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:56:54,844 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-14 20:56:54,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2024-10-14 20:56:54,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728453082] [2024-10-14 20:56:54,844 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-14 20:56:54,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 20:56:54,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:56:54,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 20:56:54,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-14 20:56:54,846 INFO L87 Difference]: Start difference. First operand 163 states and 210 transitions. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 20:56:54,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:56:54,966 INFO L93 Difference]: Finished difference Result 170 states and 213 transitions. [2024-10-14 20:56:54,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 20:56:54,967 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 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 40 [2024-10-14 20:56:54,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:56:54,968 INFO L225 Difference]: With dead ends: 170 [2024-10-14 20:56:54,968 INFO L226 Difference]: Without dead ends: 163 [2024-10-14 20:56:54,968 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2024-10-14 20:56:54,969 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 76 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:56:54,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 67 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:56:54,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-10-14 20:56:54,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 159. [2024-10-14 20:56:54,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 136 states have (on average 1.3308823529411764) internal successors, (181), 148 states have internal predecessors, (181), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-14 20:56:54,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 197 transitions. [2024-10-14 20:56:54,978 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 197 transitions. Word has length 40 [2024-10-14 20:56:54,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:56:54,979 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 197 transitions. [2024-10-14 20:56:54,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 20:56:54,979 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 197 transitions. [2024-10-14 20:56:54,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-14 20:56:54,980 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:56:54,980 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:56:54,998 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-14 20:56:55,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:56:55,181 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 20:56:55,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:56:55,181 INFO L85 PathProgramCache]: Analyzing trace with hash 523966820, now seen corresponding path program 1 times [2024-10-14 20:56:55,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:56:55,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773740641] [2024-10-14 20:56:55,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:56:55,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:56:55,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 20:56:55,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [625126456] [2024-10-14 20:56:55,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:56:55,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:56:55,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:56:55,196 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 20:56:55,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-14 20:56:55,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:55,243 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 20:56:55,244 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:56:55,420 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 20:56:55,420 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 20:56:55,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:56:55,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773740641] [2024-10-14 20:56:55,792 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 20:56:55,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [625126456] [2024-10-14 20:56:55,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [625126456] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:56:55,792 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-14 20:56:55,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2024-10-14 20:56:55,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852431650] [2024-10-14 20:56:55,792 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-14 20:56:55,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 20:56:55,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:56:55,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 20:56:55,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-14 20:56:55,794 INFO L87 Difference]: Start difference. First operand 159 states and 197 transitions. Second operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 20:56:55,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:56:55,995 INFO L93 Difference]: Finished difference Result 215 states and 265 transitions. [2024-10-14 20:56:55,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 20:56:55,996 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 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 41 [2024-10-14 20:56:55,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:56:55,997 INFO L225 Difference]: With dead ends: 215 [2024-10-14 20:56:55,997 INFO L226 Difference]: Without dead ends: 210 [2024-10-14 20:56:55,997 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-14 20:56:55,998 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 70 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 20:56:55,999 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 144 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 20:56:56,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-10-14 20:56:56,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 202. [2024-10-14 20:56:56,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 177 states have (on average 1.310734463276836) internal successors, (232), 189 states have internal predecessors, (232), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-14 20:56:56,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 252 transitions. [2024-10-14 20:56:56,012 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 252 transitions. Word has length 41 [2024-10-14 20:56:56,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:56:56,013 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 252 transitions. [2024-10-14 20:56:56,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 20:56:56,013 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 252 transitions. [2024-10-14 20:56:56,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-14 20:56:56,015 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:56:56,015 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:56:56,032 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-14 20:56:56,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-14 20:56:56,216 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 20:56:56,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:56:56,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1247676088, now seen corresponding path program 1 times [2024-10-14 20:56:56,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:56:56,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868253207] [2024-10-14 20:56:56,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:56:56,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:56:56,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:56,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 20:56:56,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:56,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 20:56:56,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:56,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-14 20:56:56,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:56,306 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 20:56:56,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:56:56,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868253207] [2024-10-14 20:56:56,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868253207] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:56:56,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [791197474] [2024-10-14 20:56:56,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:56:56,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:56:56,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:56:56,308 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 20:56:56,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-14 20:56:56,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:56,354 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 20:56:56,357 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:56:56,465 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 20:56:56,465 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 20:56:56,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [791197474] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:56:56,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 20:56:56,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2024-10-14 20:56:56,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521211416] [2024-10-14 20:56:56,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:56:56,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 20:56:56,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:56:56,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 20:56:56,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-14 20:56:56,467 INFO L87 Difference]: Start difference. First operand 202 states and 252 transitions. Second operand has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 20:56:56,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:56:56,641 INFO L93 Difference]: Finished difference Result 202 states and 252 transitions. [2024-10-14 20:56:56,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 20:56:56,642 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 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 42 [2024-10-14 20:56:56,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:56:56,643 INFO L225 Difference]: With dead ends: 202 [2024-10-14 20:56:56,643 INFO L226 Difference]: Without dead ends: 200 [2024-10-14 20:56:56,644 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-14 20:56:56,644 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 28 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 20:56:56,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 75 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 20:56:56,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-10-14 20:56:56,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 197. [2024-10-14 20:56:56,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 174 states have (on average 1.2988505747126438) internal successors, (226), 184 states have internal predecessors, (226), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-14 20:56:56,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 246 transitions. [2024-10-14 20:56:56,655 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 246 transitions. Word has length 42 [2024-10-14 20:56:56,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:56:56,655 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 246 transitions. [2024-10-14 20:56:56,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 20:56:56,655 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 246 transitions. [2024-10-14 20:56:56,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-14 20:56:56,656 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:56:56,656 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:56:56,674 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-14 20:56:56,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-14 20:56:56,857 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 20:56:56,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:56:56,857 INFO L85 PathProgramCache]: Analyzing trace with hash 23253168, now seen corresponding path program 1 times [2024-10-14 20:56:56,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:56:56,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330716162] [2024-10-14 20:56:56,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:56:56,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:56:56,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:57,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 20:56:57,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:57,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 20:56:57,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:57,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-14 20:56:57,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:57,042 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 20:56:57,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:56:57,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330716162] [2024-10-14 20:56:57,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330716162] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:56:57,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1559239216] [2024-10-14 20:56:57,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:56:57,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:56:57,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:56:57,045 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 20:56:57,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-14 20:56:57,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:57,101 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 20:56:57,102 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:56:57,206 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 20:56:57,207 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 20:56:57,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1559239216] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:56:57,386 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 20:56:57,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 3] total 11 [2024-10-14 20:56:57,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996960101] [2024-10-14 20:56:57,387 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 20:56:57,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 20:56:57,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:56:57,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 20:56:57,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2024-10-14 20:56:57,389 INFO L87 Difference]: Start difference. First operand 197 states and 246 transitions. Second operand has 12 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 4 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-14 20:56:57,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:56:57,827 INFO L93 Difference]: Finished difference Result 224 states and 265 transitions. [2024-10-14 20:56:57,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-14 20:56:57,828 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 4 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 43 [2024-10-14 20:56:57,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:56:57,829 INFO L225 Difference]: With dead ends: 224 [2024-10-14 20:56:57,829 INFO L226 Difference]: Without dead ends: 201 [2024-10-14 20:56:57,830 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=182, Invalid=468, Unknown=0, NotChecked=0, Total=650 [2024-10-14 20:56:57,831 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 170 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 20:56:57,832 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 158 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 20:56:57,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-10-14 20:56:57,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 193. [2024-10-14 20:56:57,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 170 states have (on average 1.2294117647058824) internal successors, (209), 180 states have internal predecessors, (209), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-14 20:56:57,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 229 transitions. [2024-10-14 20:56:57,842 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 229 transitions. Word has length 43 [2024-10-14 20:56:57,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:56:57,842 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 229 transitions. [2024-10-14 20:56:57,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 4 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-14 20:56:57,842 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 229 transitions. [2024-10-14 20:56:57,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-14 20:56:57,843 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:56:57,843 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:56:57,860 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-10-14 20:56:58,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-14 20:56:58,044 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 20:56:58,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:56:58,044 INFO L85 PathProgramCache]: Analyzing trace with hash 733254281, now seen corresponding path program 1 times [2024-10-14 20:56:58,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:56:58,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079578518] [2024-10-14 20:56:58,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:56:58,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:56:58,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:58,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 20:56:58,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:58,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 20:56:58,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:58,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-14 20:56:58,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:58,127 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 20:56:58,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:56:58,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079578518] [2024-10-14 20:56:58,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079578518] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:56:58,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1004312767] [2024-10-14 20:56:58,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:56:58,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:56:58,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:56:58,129 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 20:56:58,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-14 20:56:58,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:58,171 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 20:56:58,174 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:56:58,239 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 20:56:58,239 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 20:56:58,298 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 20:56:58,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1004312767] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 20:56:58,298 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 20:56:58,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 6] total 9 [2024-10-14 20:56:58,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385298040] [2024-10-14 20:56:58,299 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 20:56:58,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 20:56:58,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:56:58,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 20:56:58,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-14 20:56:58,300 INFO L87 Difference]: Start difference. First operand 193 states and 229 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-14 20:56:58,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:56:58,352 INFO L93 Difference]: Finished difference Result 197 states and 232 transitions. [2024-10-14 20:56:58,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 20:56:58,353 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 44 [2024-10-14 20:56:58,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:56:58,353 INFO L225 Difference]: With dead ends: 197 [2024-10-14 20:56:58,353 INFO L226 Difference]: Without dead ends: 0 [2024-10-14 20:56:58,354 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 88 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-14 20:56:58,354 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 16 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:56:58,354 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 116 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:56:58,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-14 20:56:58,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-14 20:56:58,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:56:58,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-14 20:56:58,355 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 44 [2024-10-14 20:56:58,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:56:58,355 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-14 20:56:58,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-14 20:56:58,355 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-14 20:56:58,356 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-14 20:56:58,359 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 22 remaining) [2024-10-14 20:56:58,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 22 remaining) [2024-10-14 20:56:58,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 22 remaining) [2024-10-14 20:56:58,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 22 remaining) [2024-10-14 20:56:58,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 22 remaining) [2024-10-14 20:56:58,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 22 remaining) [2024-10-14 20:56:58,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 22 remaining) [2024-10-14 20:56:58,361 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 22 remaining) [2024-10-14 20:56:58,361 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 22 remaining) [2024-10-14 20:56:58,362 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 22 remaining) [2024-10-14 20:56:58,362 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 22 remaining) [2024-10-14 20:56:58,363 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 22 remaining) [2024-10-14 20:56:58,363 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 22 remaining) [2024-10-14 20:56:58,363 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 22 remaining) [2024-10-14 20:56:58,363 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 22 remaining) [2024-10-14 20:56:58,363 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 22 remaining) [2024-10-14 20:56:58,364 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 22 remaining) [2024-10-14 20:56:58,364 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 22 remaining) [2024-10-14 20:56:58,364 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 22 remaining) [2024-10-14 20:56:58,364 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 22 remaining) [2024-10-14 20:56:58,364 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 22 remaining) [2024-10-14 20:56:58,365 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 22 remaining) [2024-10-14 20:56:58,381 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-10-14 20:56:58,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-14 20:56:58,568 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:56:58,569 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-14 20:56:58,677 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 20:56:58,696 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 08:56:58 BoogieIcfgContainer [2024-10-14 20:56:58,696 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 20:56:58,696 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 20:56:58,696 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 20:56:58,697 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 20:56:58,697 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:56:49" (3/4) ... [2024-10-14 20:56:58,699 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-14 20:56:58,702 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-14 20:56:58,702 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-10-14 20:56:58,706 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2024-10-14 20:56:58,706 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-14 20:56:58,707 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-14 20:56:58,707 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-14 20:56:58,790 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 20:56:58,790 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-14 20:56:58,790 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 20:56:58,791 INFO L158 Benchmark]: Toolchain (without parser) took 10485.85ms. Allocated memory was 153.1MB in the beginning and 184.5MB in the end (delta: 31.5MB). Free memory was 114.2MB in the beginning and 140.3MB in the end (delta: -26.1MB). Peak memory consumption was 8.2MB. Max. memory is 16.1GB. [2024-10-14 20:56:58,791 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 153.1MB. Free memory is still 122.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 20:56:58,791 INFO L158 Benchmark]: CACSL2BoogieTranslator took 256.23ms. Allocated memory is still 153.1MB. Free memory was 113.9MB in the beginning and 102.5MB in the end (delta: 11.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-14 20:56:58,792 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.88ms. Allocated memory is still 153.1MB. Free memory was 102.5MB in the beginning and 100.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 20:56:58,792 INFO L158 Benchmark]: Boogie Preprocessor took 45.17ms. Allocated memory is still 153.1MB. Free memory was 100.8MB in the beginning and 99.2MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 20:56:58,792 INFO L158 Benchmark]: RCFGBuilder took 510.88ms. Allocated memory is still 153.1MB. Free memory was 99.2MB in the beginning and 84.1MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-14 20:56:58,793 INFO L158 Benchmark]: TraceAbstraction took 9530.69ms. Allocated memory was 153.1MB in the beginning and 184.5MB in the end (delta: 31.5MB). Free memory was 83.2MB in the beginning and 145.5MB in the end (delta: -62.4MB). Peak memory consumption was 69.8MB. Max. memory is 16.1GB. [2024-10-14 20:56:58,793 INFO L158 Benchmark]: Witness Printer took 94.10ms. Allocated memory is still 184.5MB. Free memory was 145.5MB in the beginning and 140.3MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-14 20:56:58,794 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.33ms. Allocated memory is still 153.1MB. Free memory is still 122.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 256.23ms. Allocated memory is still 153.1MB. Free memory was 113.9MB in the beginning and 102.5MB in the end (delta: 11.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.88ms. Allocated memory is still 153.1MB. Free memory was 102.5MB in the beginning and 100.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.17ms. Allocated memory is still 153.1MB. Free memory was 100.8MB in the beginning and 99.2MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 510.88ms. Allocated memory is still 153.1MB. Free memory was 99.2MB in the beginning and 84.1MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 9530.69ms. Allocated memory was 153.1MB in the beginning and 184.5MB in the end (delta: 31.5MB). Free memory was 83.2MB in the beginning and 145.5MB in the end (delta: -62.4MB). Peak memory consumption was 69.8MB. Max. memory is 16.1GB. * Witness Printer took 94.10ms. Allocated memory is still 184.5MB. Free memory was 145.5MB in the beginning and 140.3MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 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: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: 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, 64 locations, 22 error locations. Started 1 CEGAR loops. OverallTime: 9.3s, OverallIterations: 16, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 943 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 934 mSDsluCounter, 1846 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1100 mSDsCounter, 78 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1146 IncrementalHoareTripleChecker+Invalid, 1224 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 78 mSolverCounterUnsat, 746 mSDtfsCounter, 1146 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 628 GetRequests, 523 SyntacticMatches, 3 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=202occurred in iteration=13, InterpolantAutomatonStates: 88, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 90 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 860 NumberOfCodeBlocks, 860 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 793 ConstructedInterpolants, 0 QuantifiedInterpolants, 3062 SizeOfPredicates, 9 NumberOfNonLiveVariables, 926 ConjunctsInSsa, 56 ConjunctsInUnsatCore, 25 InterpolantComputations, 11 PerfectInterpolantSequences, 115/161 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 22 specifications checked. All of them hold - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: ((((((((((0 <= x1) && (y3 <= 2147483647)) && (x2 <= 2147483647)) && (y2 == 0)) && (y1 == 0)) && (counter == 0)) && (x1 <= 2147483647)) && (0 <= y3)) || ((((((((0 <= x1) && (x2 <= 2147483647)) && (y2 == 1)) && (y1 == 0)) && (y3 <= 2147483646)) && (x1 <= 2147483647)) && (counter == 1)) && (0 <= y3))) || (((((((((0 <= x1) && (y3 <= 2147483647)) && (x2 <= 2147483647)) && (y2 == 0)) && (1 <= x2)) && (y1 == 1)) && (0 <= ((long long) 2147483647 + y3))) && (x1 <= 2147483647)) && (counter == 1))) - ProcedureContractResult [Line: 12]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: (counter == 0) Ensures: ((cond != 0) && (counter == 0)) RESULT: Ultimate proved your program to be correct! [2024-10-14 20:56:58,820 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE