./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-multidimensional/init-non-constant-2-n-u.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-multidimensional/init-non-constant-2-n-u.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 4fa401c700a21fa1f98a1481c8e8ba1555a45c0429555dc041a1c04ce1059991 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 12:53:17,368 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 12:53:17,412 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-13 12:53:17,416 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 12:53:17,417 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 12:53:17,447 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 12:53:17,447 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 12:53:17,448 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 12:53:17,448 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 12:53:17,448 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 12:53:17,449 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 12:53:17,449 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 12:53:17,449 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 12:53:17,450 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 12:53:17,450 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 12:53:17,450 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 12:53:17,450 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 12:53:17,451 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 12:53:17,451 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 12:53:17,451 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 12:53:17,451 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 12:53:17,452 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 12:53:17,452 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 12:53:17,452 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 12:53:17,452 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 12:53:17,453 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-13 12:53:17,453 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 12:53:17,453 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 12:53:17,453 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 12:53:17,453 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 12:53:17,454 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 12:53:17,454 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 12:53:17,454 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 12:53:17,454 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 12:53:17,455 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:53:17,455 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 12:53:17,455 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 12:53:17,455 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 12:53:17,455 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 12:53:17,456 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 12:53:17,456 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 12:53:17,456 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 12:53:17,456 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 12:53:17,456 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 12:53:17,457 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 -> 4fa401c700a21fa1f98a1481c8e8ba1555a45c0429555dc041a1c04ce1059991 [2024-10-13 12:53:17,678 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 12:53:17,698 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 12:53:17,700 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 12:53:17,701 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 12:53:17,701 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 12:53:17,702 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-multidimensional/init-non-constant-2-n-u.c [2024-10-13 12:53:19,005 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 12:53:19,180 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 12:53:19,181 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-multidimensional/init-non-constant-2-n-u.c [2024-10-13 12:53:19,187 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30809adff/ce345468d5824da9a2f9e93cc5a05e49/FLAG8736a95ed [2024-10-13 12:53:19,199 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30809adff/ce345468d5824da9a2f9e93cc5a05e49 [2024-10-13 12:53:19,201 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 12:53:19,202 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 12:53:19,204 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 12:53:19,204 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 12:53:19,209 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 12:53:19,209 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:53:19" (1/1) ... [2024-10-13 12:53:19,210 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22179a70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:53:19, skipping insertion in model container [2024-10-13 12:53:19,210 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:53:19" (1/1) ... [2024-10-13 12:53:19,227 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 12:53:19,432 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:53:19,443 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 12:53:19,463 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:53:19,481 INFO L204 MainTranslator]: Completed translation [2024-10-13 12:53:19,482 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:53:19 WrapperNode [2024-10-13 12:53:19,482 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 12:53:19,483 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 12:53:19,483 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 12:53:19,483 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 12:53:19,489 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:53:19" (1/1) ... [2024-10-13 12:53:19,496 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:53:19" (1/1) ... [2024-10-13 12:53:19,513 INFO L138 Inliner]: procedures = 16, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 84 [2024-10-13 12:53:19,513 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 12:53:19,514 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 12:53:19,514 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 12:53:19,514 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 12:53:19,522 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:53:19" (1/1) ... [2024-10-13 12:53:19,522 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:53:19" (1/1) ... [2024-10-13 12:53:19,524 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:53:19" (1/1) ... [2024-10-13 12:53:19,535 INFO L175 MemorySlicer]: Split 4 memory accesses to 2 slices as follows [2, 2]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-10-13 12:53:19,535 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:53:19" (1/1) ... [2024-10-13 12:53:19,535 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:53:19" (1/1) ... [2024-10-13 12:53:19,539 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:53:19" (1/1) ... [2024-10-13 12:53:19,542 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:53:19" (1/1) ... [2024-10-13 12:53:19,543 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:53:19" (1/1) ... [2024-10-13 12:53:19,544 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:53:19" (1/1) ... [2024-10-13 12:53:19,546 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 12:53:19,547 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 12:53:19,547 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 12:53:19,547 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 12:53:19,548 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:53:19" (1/1) ... [2024-10-13 12:53:19,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:53:19,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:53:19,585 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 12:53:19,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 12:53:19,635 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 12:53:19,635 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 12:53:19,635 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 12:53:19,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 12:53:19,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 12:53:19,636 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-13 12:53:19,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 12:53:19,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 12:53:19,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 12:53:19,637 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 12:53:19,638 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 12:53:19,638 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-13 12:53:19,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 12:53:19,695 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 12:53:19,696 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 12:53:19,903 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2024-10-13 12:53:19,904 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 12:53:19,927 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 12:53:19,927 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-13 12:53:19,928 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:53:19 BoogieIcfgContainer [2024-10-13 12:53:19,928 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 12:53:19,929 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 12:53:19,929 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 12:53:19,933 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 12:53:19,933 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:53:19" (1/3) ... [2024-10-13 12:53:19,934 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15d99135 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:53:19, skipping insertion in model container [2024-10-13 12:53:19,934 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:53:19" (2/3) ... [2024-10-13 12:53:19,934 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15d99135 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:53:19, skipping insertion in model container [2024-10-13 12:53:19,934 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:53:19" (3/3) ... [2024-10-13 12:53:19,935 INFO L112 eAbstractionObserver]: Analyzing ICFG init-non-constant-2-n-u.c [2024-10-13 12:53:19,949 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 12:53:19,949 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2024-10-13 12:53:20,008 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 12:53:20,017 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;@50a5f1f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 12:53:20,017 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2024-10-13 12:53:20,021 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 37 states have internal predecessors, (46), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 12:53:20,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-13 12:53:20,026 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:53:20,027 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:53:20,027 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-13 12:53:20,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:53:20,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1028593088, now seen corresponding path program 1 times [2024-10-13 12:53:20,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:53:20,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682291642] [2024-10-13 12:53:20,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:53:20,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:53:20,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:53:20,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 12:53:20,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:53:20,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 12:53:20,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:53:20,208 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-13 12:53:20,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:53:20,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682291642] [2024-10-13 12:53:20,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682291642] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:53:20,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:53:20,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:53:20,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048102897] [2024-10-13 12:53:20,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:53:20,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 12:53:20,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:53:20,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 12:53:20,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 12:53:20,235 INFO L87 Difference]: Start difference. First operand has 40 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 37 states have internal predecessors, (46), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) 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-13 12:53:20,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:53:20,259 INFO L93 Difference]: Finished difference Result 78 states and 99 transitions. [2024-10-13 12:53:20,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 12:53:20,261 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-13 12:53:20,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:53:20,266 INFO L225 Difference]: With dead ends: 78 [2024-10-13 12:53:20,267 INFO L226 Difference]: Without dead ends: 38 [2024-10-13 12:53:20,269 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-13 12:53:20,273 INFO L432 NwaCegarLoop]: 42 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, 42 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-13 12:53:20,276 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 12:53:20,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-10-13 12:53:20,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-10-13 12:53:20,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 35 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 12:53:20,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2024-10-13 12:53:20,313 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 14 [2024-10-13 12:53:20,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:53:20,313 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2024-10-13 12:53:20,313 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-13 12:53:20,314 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2024-10-13 12:53:20,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-13 12:53:20,315 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:53:20,315 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:53:20,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 12:53:20,316 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-13 12:53:20,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:53:20,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1786915596, now seen corresponding path program 1 times [2024-10-13 12:53:20,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:53:20,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452525478] [2024-10-13 12:53:20,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:53:20,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:53:20,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:53:20,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 12:53:20,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:53:20,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 12:53:20,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:53:20,460 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-13 12:53:20,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:53:20,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452525478] [2024-10-13 12:53:20,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452525478] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:53:20,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:53:20,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:53:20,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400103118] [2024-10-13 12:53:20,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:53:20,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:53:20,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:53:20,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:53:20,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:53:20,463 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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-13 12:53:20,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:53:20,526 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2024-10-13 12:53:20,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:53:20,529 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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-13 12:53:20,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:53:20,530 INFO L225 Difference]: With dead ends: 64 [2024-10-13 12:53:20,530 INFO L226 Difference]: Without dead ends: 60 [2024-10-13 12:53:20,530 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:53:20,531 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 20 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 12:53:20,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 43 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 12:53:20,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-10-13 12:53:20,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 56. [2024-10-13 12:53:20,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 41 states have (on average 1.6341463414634145) internal successors, (67), 52 states have internal predecessors, (67), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 12:53:20,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 71 transitions. [2024-10-13 12:53:20,538 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 71 transitions. Word has length 14 [2024-10-13 12:53:20,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:53:20,539 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 71 transitions. [2024-10-13 12:53:20,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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-13 12:53:20,539 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 71 transitions. [2024-10-13 12:53:20,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-13 12:53:20,540 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:53:20,540 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:53:20,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 12:53:20,540 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-13 12:53:20,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:53:20,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1786915647, now seen corresponding path program 1 times [2024-10-13 12:53:20,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:53:20,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562718219] [2024-10-13 12:53:20,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:53:20,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:53:20,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:53:20,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 12:53:20,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:53:20,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 12:53:20,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:53:20,648 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-13 12:53:20,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:53:20,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562718219] [2024-10-13 12:53:20,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562718219] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:53:20,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:53:20,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:53:20,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032790168] [2024-10-13 12:53:20,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:53:20,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:53:20,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:53:20,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:53:20,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:53:20,651 INFO L87 Difference]: Start difference. First operand 56 states and 71 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-13 12:53:20,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:53:20,748 INFO L93 Difference]: Finished difference Result 80 states and 93 transitions. [2024-10-13 12:53:20,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:53:20,749 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-13 12:53:20,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:53:20,750 INFO L225 Difference]: With dead ends: 80 [2024-10-13 12:53:20,750 INFO L226 Difference]: Without dead ends: 72 [2024-10-13 12:53:20,751 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-13 12:53:20,751 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 43 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 12:53:20,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 46 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 12:53:20,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-13 12:53:20,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 68. [2024-10-13 12:53:20,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 53 states have (on average 1.528301886792453) internal successors, (81), 64 states have internal predecessors, (81), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 12:53:20,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 85 transitions. [2024-10-13 12:53:20,759 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 85 transitions. Word has length 14 [2024-10-13 12:53:20,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:53:20,759 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 85 transitions. [2024-10-13 12:53:20,759 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-13 12:53:20,760 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 85 transitions. [2024-10-13 12:53:20,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-13 12:53:20,760 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:53:20,760 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:53:20,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 12:53:20,760 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-13 12:53:20,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:53:20,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1203969629, now seen corresponding path program 1 times [2024-10-13 12:53:20,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:53:20,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355171305] [2024-10-13 12:53:20,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:53:20,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:53:20,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:53:20,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 12:53:20,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:53:20,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 12:53:20,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:53:20,822 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-13 12:53:20,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:53:20,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355171305] [2024-10-13 12:53:20,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355171305] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 12:53:20,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005628171] [2024-10-13 12:53:20,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:53:20,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:53:20,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:53:20,824 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 12:53:20,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 12:53:20,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:53:20,884 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 12:53:20,888 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:53:20,949 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-13 12:53:20,949 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:53:20,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1005628171] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:53:20,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 12:53:20,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2024-10-13 12:53:20,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576190911] [2024-10-13 12:53:20,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:53:20,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:53:20,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:53:20,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:53:20,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:53:20,954 INFO L87 Difference]: Start difference. First operand 68 states and 85 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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-13 12:53:21,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:53:21,026 INFO L93 Difference]: Finished difference Result 72 states and 85 transitions. [2024-10-13 12:53:21,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:53:21,028 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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 18 [2024-10-13 12:53:21,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:53:21,028 INFO L225 Difference]: With dead ends: 72 [2024-10-13 12:53:21,029 INFO L226 Difference]: Without dead ends: 70 [2024-10-13 12:53:21,029 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 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-13 12:53:21,030 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 43 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 12:53:21,030 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 48 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 12:53:21,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-10-13 12:53:21,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 66. [2024-10-13 12:53:21,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 53 states have (on average 1.490566037735849) internal successors, (79), 62 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 12:53:21,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 83 transitions. [2024-10-13 12:53:21,043 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 83 transitions. Word has length 18 [2024-10-13 12:53:21,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:53:21,043 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 83 transitions. [2024-10-13 12:53:21,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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-13 12:53:21,044 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 83 transitions. [2024-10-13 12:53:21,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-13 12:53:21,044 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:53:21,044 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:53:21,059 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-13 12:53:21,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:53:21,245 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-13 12:53:21,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:53:21,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1203969578, now seen corresponding path program 1 times [2024-10-13 12:53:21,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:53:21,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261700310] [2024-10-13 12:53:21,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:53:21,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:53:21,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:53:21,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 12:53:21,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:53:21,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 12:53:21,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:53:21,364 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-13 12:53:21,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:53:21,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261700310] [2024-10-13 12:53:21,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261700310] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:53:21,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:53:21,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 12:53:21,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421185526] [2024-10-13 12:53:21,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:53:21,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 12:53:21,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:53:21,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 12:53:21,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:53:21,371 INFO L87 Difference]: Start difference. First operand 66 states and 83 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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-13 12:53:21,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:53:21,460 INFO L93 Difference]: Finished difference Result 141 states and 181 transitions. [2024-10-13 12:53:21,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 12:53:21,460 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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 18 [2024-10-13 12:53:21,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:53:21,461 INFO L225 Difference]: With dead ends: 141 [2024-10-13 12:53:21,461 INFO L226 Difference]: Without dead ends: 95 [2024-10-13 12:53:21,461 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-13 12:53:21,462 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 17 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 12:53:21,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 77 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 12:53:21,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-10-13 12:53:21,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2024-10-13 12:53:21,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 80 states have (on average 1.4375) internal successors, (115), 89 states have internal predecessors, (115), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 12:53:21,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 119 transitions. [2024-10-13 12:53:21,478 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 119 transitions. Word has length 18 [2024-10-13 12:53:21,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:53:21,481 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 119 transitions. [2024-10-13 12:53:21,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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-13 12:53:21,482 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 119 transitions. [2024-10-13 12:53:21,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-13 12:53:21,482 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:53:21,482 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:53:21,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 12:53:21,482 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-13 12:53:21,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:53:21,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1331647232, now seen corresponding path program 1 times [2024-10-13 12:53:21,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:53:21,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172410822] [2024-10-13 12:53:21,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:53:21,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:53:21,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:53:21,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 12:53:21,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:53:21,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 12:53:21,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:53:21,564 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-13 12:53:21,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:53:21,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172410822] [2024-10-13 12:53:21,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172410822] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 12:53:21,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1407982312] [2024-10-13 12:53:21,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:53:21,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:53:21,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:53:21,567 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 12:53:21,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 12:53:21,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:53:21,611 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 12:53:21,612 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:53:21,645 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-13 12:53:21,645 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:53:21,694 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-13 12:53:21,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1407982312] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:53:21,696 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 12:53:21,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-13 12:53:21,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270492116] [2024-10-13 12:53:21,697 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 12:53:21,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 12:53:21,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:53:21,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 12:53:21,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-13 12:53:21,698 INFO L87 Difference]: Start difference. First operand 93 states and 119 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-13 12:53:21,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:53:21,805 INFO L93 Difference]: Finished difference Result 225 states and 299 transitions. [2024-10-13 12:53:21,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 12:53:21,805 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 19 [2024-10-13 12:53:21,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:53:21,808 INFO L225 Difference]: With dead ends: 225 [2024-10-13 12:53:21,810 INFO L226 Difference]: Without dead ends: 223 [2024-10-13 12:53:21,811 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-13 12:53:21,811 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 114 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 12:53:21,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 90 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 12:53:21,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-10-13 12:53:21,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 207. [2024-10-13 12:53:21,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 194 states have (on average 1.458762886597938) internal successors, (283), 203 states have internal predecessors, (283), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 12:53:21,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 287 transitions. [2024-10-13 12:53:21,837 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 287 transitions. Word has length 19 [2024-10-13 12:53:21,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:53:21,837 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 287 transitions. [2024-10-13 12:53:21,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-13 12:53:21,838 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 287 transitions. [2024-10-13 12:53:21,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-13 12:53:21,838 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:53:21,839 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:53:21,853 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-13 12:53:22,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-13 12:53:22,040 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-13 12:53:22,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:53:22,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1512936035, now seen corresponding path program 1 times [2024-10-13 12:53:22,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:53:22,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133393579] [2024-10-13 12:53:22,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:53:22,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:53:22,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:53:22,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 12:53:22,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:53:22,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 12:53:22,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:53:22,114 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-13 12:53:22,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:53:22,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133393579] [2024-10-13 12:53:22,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133393579] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 12:53:22,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [875857621] [2024-10-13 12:53:22,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:53:22,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:53:22,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:53:22,117 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 12:53:22,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-13 12:53:22,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:53:22,161 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 12:53:22,162 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:53:22,229 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-13 12:53:22,230 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:53:22,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [875857621] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:53:22,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 12:53:22,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2024-10-13 12:53:22,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911978010] [2024-10-13 12:53:22,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:53:22,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 12:53:22,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:53:22,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 12:53:22,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-10-13 12:53:22,231 INFO L87 Difference]: Start difference. First operand 207 states and 287 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 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-13 12:53:22,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:53:22,325 INFO L93 Difference]: Finished difference Result 207 states and 287 transitions. [2024-10-13 12:53:22,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 12:53:22,325 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 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-13 12:53:22,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:53:22,326 INFO L225 Difference]: With dead ends: 207 [2024-10-13 12:53:22,326 INFO L226 Difference]: Without dead ends: 203 [2024-10-13 12:53:22,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-10-13 12:53:22,327 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 21 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 12:53:22,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 29 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 12:53:22,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-10-13 12:53:22,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2024-10-13 12:53:22,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 194 states have (on average 1.3144329896907216) internal successors, (255), 199 states have internal predecessors, (255), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 12:53:22,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 259 transitions. [2024-10-13 12:53:22,345 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 259 transitions. Word has length 19 [2024-10-13 12:53:22,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:53:22,346 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 259 transitions. [2024-10-13 12:53:22,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 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-13 12:53:22,346 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 259 transitions. [2024-10-13 12:53:22,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-13 12:53:22,346 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:53:22,347 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:53:22,359 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-13 12:53:22,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:53:22,547 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-13 12:53:22,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:53:22,548 INFO L85 PathProgramCache]: Analyzing trace with hash 343623227, now seen corresponding path program 1 times [2024-10-13 12:53:22,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:53:22,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493323506] [2024-10-13 12:53:22,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:53:22,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:53:22,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:53:22,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 12:53:22,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:53:22,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 12:53:22,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:53:22,625 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-13 12:53:22,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:53:22,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493323506] [2024-10-13 12:53:22,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493323506] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 12:53:22,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624799716] [2024-10-13 12:53:22,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:53:22,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:53:22,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:53:22,627 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 12:53:22,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-13 12:53:22,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:53:22,666 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 12:53:22,667 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:53:22,714 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-13 12:53:22,715 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:53:22,761 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-13 12:53:22,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [624799716] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:53:22,762 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 12:53:22,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2024-10-13 12:53:22,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540749661] [2024-10-13 12:53:22,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 12:53:22,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 12:53:22,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:53:22,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 12:53:22,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2024-10-13 12:53:22,764 INFO L87 Difference]: Start difference. First operand 203 states and 259 transitions. Second operand has 11 states, 10 states have (on average 3.3) internal successors, (33), 11 states have internal predecessors, (33), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-13 12:53:22,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:53:22,986 INFO L93 Difference]: Finished difference Result 239 states and 305 transitions. [2024-10-13 12:53:22,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 12:53:22,987 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.3) internal successors, (33), 11 states have internal predecessors, (33), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 20 [2024-10-13 12:53:22,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:53:22,988 INFO L225 Difference]: With dead ends: 239 [2024-10-13 12:53:22,988 INFO L226 Difference]: Without dead ends: 235 [2024-10-13 12:53:22,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=125, Unknown=0, NotChecked=0, Total=210 [2024-10-13 12:53:22,989 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 188 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 12:53:22,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 51 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 12:53:22,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-10-13 12:53:23,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 233. [2024-10-13 12:53:23,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 224 states have (on average 1.28125) internal successors, (287), 229 states have internal predecessors, (287), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 12:53:23,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 291 transitions. [2024-10-13 12:53:23,007 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 291 transitions. Word has length 20 [2024-10-13 12:53:23,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:53:23,007 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 291 transitions. [2024-10-13 12:53:23,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.3) internal successors, (33), 11 states have internal predecessors, (33), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-13 12:53:23,008 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 291 transitions. [2024-10-13 12:53:23,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-13 12:53:23,009 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:53:23,010 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-10-13 12:53:23,026 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-13 12:53:23,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:53:23,211 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-13 12:53:23,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:53:23,211 INFO L85 PathProgramCache]: Analyzing trace with hash 579132635, now seen corresponding path program 2 times [2024-10-13 12:53:23,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:53:23,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669485809] [2024-10-13 12:53:23,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:53:23,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:53:23,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:53:23,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 12:53:23,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:53:23,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 12:53:23,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:53:23,277 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-13 12:53:23,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:53:23,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669485809] [2024-10-13 12:53:23,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669485809] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 12:53:23,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188002586] [2024-10-13 12:53:23,278 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 12:53:23,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:53:23,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:53:23,280 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 12:53:23,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-13 12:53:23,315 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-13 12:53:23,316 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 12:53:23,316 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 12:53:23,317 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:53:23,347 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-13 12:53:23,348 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:53:23,381 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-13 12:53:23,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [188002586] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:53:23,382 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 12:53:23,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2024-10-13 12:53:23,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382281947] [2024-10-13 12:53:23,382 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 12:53:23,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:53:23,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:53:23,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:53:23,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:53:23,385 INFO L87 Difference]: Start difference. First operand 233 states and 291 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-13 12:53:23,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:53:23,432 INFO L93 Difference]: Finished difference Result 233 states and 291 transitions. [2024-10-13 12:53:23,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:53:23,433 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 31 [2024-10-13 12:53:23,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:53:23,435 INFO L225 Difference]: With dead ends: 233 [2024-10-13 12:53:23,435 INFO L226 Difference]: Without dead ends: 192 [2024-10-13 12:53:23,435 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:53:23,436 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 41 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 12:53:23,436 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 29 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 12:53:23,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-10-13 12:53:23,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 116. [2024-10-13 12:53:23,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 109 states have (on average 1.1926605504587156) internal successors, (130), 112 states have internal predecessors, (130), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 12:53:23,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 134 transitions. [2024-10-13 12:53:23,444 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 134 transitions. Word has length 31 [2024-10-13 12:53:23,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:53:23,448 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 134 transitions. [2024-10-13 12:53:23,449 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-13 12:53:23,449 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 134 transitions. [2024-10-13 12:53:23,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-13 12:53:23,450 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:53:23,450 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:53:23,465 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-13 12:53:23,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:53:23,651 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-13 12:53:23,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:53:23,651 INFO L85 PathProgramCache]: Analyzing trace with hash 283017138, now seen corresponding path program 1 times [2024-10-13 12:53:23,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:53:23,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534737823] [2024-10-13 12:53:23,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:53:23,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:53:23,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:53:23,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 12:53:23,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:53:23,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 12:53:23,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:53:23,705 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-13 12:53:23,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:53:23,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534737823] [2024-10-13 12:53:23,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534737823] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 12:53:23,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [146299830] [2024-10-13 12:53:23,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:53:23,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:53:23,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:53:23,710 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 12:53:23,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-13 12:53:23,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:53:23,753 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 12:53:23,754 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:53:23,773 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-13 12:53:23,774 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:53:23,799 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-13 12:53:23,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [146299830] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:53:23,799 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 12:53:23,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-13 12:53:23,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57972802] [2024-10-13 12:53:23,799 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 12:53:23,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 12:53:23,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:53:23,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 12:53:23,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-13 12:53:23,800 INFO L87 Difference]: Start difference. First operand 116 states and 134 transitions. Second operand has 7 states, 6 states have (on average 6.833333333333333) internal successors, (41), 7 states have internal predecessors, (41), 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-13 12:53:23,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:53:23,878 INFO L93 Difference]: Finished difference Result 166 states and 204 transitions. [2024-10-13 12:53:23,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 12:53:23,878 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.833333333333333) internal successors, (41), 7 states have internal predecessors, (41), 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 31 [2024-10-13 12:53:23,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:53:23,879 INFO L225 Difference]: With dead ends: 166 [2024-10-13 12:53:23,879 INFO L226 Difference]: Without dead ends: 164 [2024-10-13 12:53:23,879 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-13 12:53:23,880 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 42 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 12:53:23,880 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 55 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 12:53:23,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-10-13 12:53:23,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2024-10-13 12:53:23,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 157 states have (on average 1.2229299363057324) internal successors, (192), 160 states have internal predecessors, (192), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 12:53:23,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 196 transitions. [2024-10-13 12:53:23,886 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 196 transitions. Word has length 31 [2024-10-13 12:53:23,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:53:23,886 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 196 transitions. [2024-10-13 12:53:23,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.833333333333333) internal successors, (41), 7 states have internal predecessors, (41), 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-13 12:53:23,886 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 196 transitions. [2024-10-13 12:53:23,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-13 12:53:23,887 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:53:23,887 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-10-13 12:53:23,900 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-13 12:53:24,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:53:24,088 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-13 12:53:24,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:53:24,088 INFO L85 PathProgramCache]: Analyzing trace with hash -53850823, now seen corresponding path program 1 times [2024-10-13 12:53:24,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:53:24,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870188219] [2024-10-13 12:53:24,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:53:24,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:53:24,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:53:24,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 12:53:24,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:53:24,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 12:53:24,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:53:24,148 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-13 12:53:24,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:53:24,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870188219] [2024-10-13 12:53:24,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870188219] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 12:53:24,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370444251] [2024-10-13 12:53:24,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:53:24,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:53:24,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:53:24,150 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 12:53:24,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-13 12:53:24,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:53:24,191 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 12:53:24,192 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:53:24,229 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-13 12:53:24,229 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:53:24,278 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-13 12:53:24,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370444251] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:53:24,278 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 12:53:24,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-10-13 12:53:24,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184175566] [2024-10-13 12:53:24,279 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 12:53:24,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 12:53:24,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:53:24,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 12:53:24,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2024-10-13 12:53:24,280 INFO L87 Difference]: Start difference. First operand 164 states and 196 transitions. Second operand has 12 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 12 states have internal predecessors, (63), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-13 12:53:24,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:53:24,516 INFO L93 Difference]: Finished difference Result 412 states and 517 transitions. [2024-10-13 12:53:24,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-13 12:53:24,517 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 12 states have internal predecessors, (63), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 33 [2024-10-13 12:53:24,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:53:24,518 INFO L225 Difference]: With dead ends: 412 [2024-10-13 12:53:24,518 INFO L226 Difference]: Without dead ends: 410 [2024-10-13 12:53:24,519 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=150, Invalid=230, Unknown=0, NotChecked=0, Total=380 [2024-10-13 12:53:24,519 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 287 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 12:53:24,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 48 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 12:53:24,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2024-10-13 12:53:24,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 230. [2024-10-13 12:53:24,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 223 states have (on average 1.2242152466367713) internal successors, (273), 226 states have internal predecessors, (273), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 12:53:24,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 277 transitions. [2024-10-13 12:53:24,530 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 277 transitions. Word has length 33 [2024-10-13 12:53:24,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:53:24,530 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 277 transitions. [2024-10-13 12:53:24,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 12 states have internal predecessors, (63), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-13 12:53:24,531 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 277 transitions. [2024-10-13 12:53:24,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-13 12:53:24,533 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:53:24,533 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:53:24,546 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-13 12:53:24,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:53:24,734 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-13 12:53:24,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:53:24,734 INFO L85 PathProgramCache]: Analyzing trace with hash 342807812, now seen corresponding path program 2 times [2024-10-13 12:53:24,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:53:24,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611222999] [2024-10-13 12:53:24,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:53:24,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:53:24,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:53:24,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 12:53:24,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:53:24,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 12:53:24,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:53:24,819 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 23 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-13 12:53:24,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:53:24,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611222999] [2024-10-13 12:53:24,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611222999] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 12:53:24,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1284557832] [2024-10-13 12:53:24,819 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 12:53:24,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:53:24,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:53:24,821 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-13 12:53:24,822 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-13 12:53:24,870 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 12:53:24,870 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 12:53:24,870 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 12:53:24,871 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:53:24,972 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 21 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-13 12:53:24,972 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:53:25,074 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-13 12:53:25,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1284557832] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:53:25,075 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 12:53:25,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2024-10-13 12:53:25,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221195074] [2024-10-13 12:53:25,076 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 12:53:25,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-13 12:53:25,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:53:25,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-13 12:53:25,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2024-10-13 12:53:25,077 INFO L87 Difference]: Start difference. First operand 230 states and 277 transitions. Second operand has 19 states, 19 states have (on average 3.3684210526315788) internal successors, (64), 19 states have internal predecessors, (64), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-13 12:53:25,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:53:25,557 INFO L93 Difference]: Finished difference Result 704 states and 840 transitions. [2024-10-13 12:53:25,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-13 12:53:25,557 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.3684210526315788) internal successors, (64), 19 states have internal predecessors, (64), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 34 [2024-10-13 12:53:25,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:53:25,559 INFO L225 Difference]: With dead ends: 704 [2024-10-13 12:53:25,559 INFO L226 Difference]: Without dead ends: 436 [2024-10-13 12:53:25,560 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=374, Invalid=1186, Unknown=0, NotChecked=0, Total=1560 [2024-10-13 12:53:25,560 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 409 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 12:53:25,561 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 96 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 12:53:25,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2024-10-13 12:53:25,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 207. [2024-10-13 12:53:25,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 200 states have (on average 1.165) internal successors, (233), 203 states have internal predecessors, (233), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 12:53:25,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 237 transitions. [2024-10-13 12:53:25,572 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 237 transitions. Word has length 34 [2024-10-13 12:53:25,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:53:25,572 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 237 transitions. [2024-10-13 12:53:25,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.3684210526315788) internal successors, (64), 19 states have internal predecessors, (64), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-13 12:53:25,572 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 237 transitions. [2024-10-13 12:53:25,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-13 12:53:25,573 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:53:25,573 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:53:25,585 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-13 12:53:25,773 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,SelfDestructingSolverStorable11 [2024-10-13 12:53:25,774 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-13 12:53:25,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:53:25,774 INFO L85 PathProgramCache]: Analyzing trace with hash 553671771, now seen corresponding path program 1 times [2024-10-13 12:53:25,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:53:25,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455339092] [2024-10-13 12:53:25,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:53:25,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:53:25,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:53:25,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 12:53:25,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:53:25,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 12:53:25,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:53:25,829 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-10-13 12:53:25,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:53:25,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455339092] [2024-10-13 12:53:25,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455339092] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 12:53:25,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1867495916] [2024-10-13 12:53:25,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:53:25,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:53:25,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:53:25,832 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-13 12:53:25,833 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-13 12:53:25,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:53:25,880 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 12:53:25,881 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:53:25,944 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 12:53:25,944 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:53:26,026 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 12:53:26,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1867495916] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:53:26,027 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 12:53:26,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 6, 6] total 12 [2024-10-13 12:53:26,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431072276] [2024-10-13 12:53:26,027 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 12:53:26,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-13 12:53:26,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:53:26,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-13 12:53:26,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2024-10-13 12:53:26,028 INFO L87 Difference]: Start difference. First operand 207 states and 237 transitions. Second operand has 13 states, 12 states have (on average 5.333333333333333) internal successors, (64), 13 states have internal predecessors, (64), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 12:53:26,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:53:26,235 INFO L93 Difference]: Finished difference Result 393 states and 499 transitions. [2024-10-13 12:53:26,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 12:53:26,236 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.333333333333333) internal successors, (64), 13 states have internal predecessors, (64), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 37 [2024-10-13 12:53:26,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:53:26,237 INFO L225 Difference]: With dead ends: 393 [2024-10-13 12:53:26,237 INFO L226 Difference]: Without dead ends: 262 [2024-10-13 12:53:26,238 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=198, Invalid=308, Unknown=0, NotChecked=0, Total=506 [2024-10-13 12:53:26,238 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 286 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 12:53:26,238 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 66 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 12:53:26,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2024-10-13 12:53:26,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 94. [2024-10-13 12:53:26,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 89 states have (on average 1.0786516853932584) internal successors, (96), 90 states have internal predecessors, (96), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 12:53:26,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 100 transitions. [2024-10-13 12:53:26,246 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 100 transitions. Word has length 37 [2024-10-13 12:53:26,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:53:26,247 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 100 transitions. [2024-10-13 12:53:26,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.333333333333333) internal successors, (64), 13 states have internal predecessors, (64), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 12:53:26,247 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 100 transitions. [2024-10-13 12:53:26,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-13 12:53:26,248 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:53:26,248 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:53:26,261 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-13 12:53:26,448 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,SelfDestructingSolverStorable12 [2024-10-13 12:53:26,449 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-13 12:53:26,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:53:26,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1797177284, now seen corresponding path program 3 times [2024-10-13 12:53:26,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:53:26,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754135349] [2024-10-13 12:53:26,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:53:26,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:53:26,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:53:26,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 12:53:26,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:53:26,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 12:53:26,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:53:26,566 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-13 12:53:26,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:53:26,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754135349] [2024-10-13 12:53:26,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754135349] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 12:53:26,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679218034] [2024-10-13 12:53:26,567 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 12:53:26,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:53:26,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:53:26,571 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-13 12:53:26,572 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-13 12:53:26,610 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-13 12:53:26,610 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 12:53:26,611 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 12:53:26,612 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:53:26,709 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-10-13 12:53:26,709 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:53:26,774 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-10-13 12:53:26,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1679218034] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:53:26,774 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 12:53:26,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 12 [2024-10-13 12:53:26,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131115614] [2024-10-13 12:53:26,774 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 12:53:26,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-13 12:53:26,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:53:26,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-13 12:53:26,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2024-10-13 12:53:26,775 INFO L87 Difference]: Start difference. First operand 94 states and 100 transitions. Second operand has 13 states, 12 states have (on average 5.416666666666667) internal successors, (65), 13 states have internal predecessors, (65), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-13 12:53:27,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:53:27,128 INFO L93 Difference]: Finished difference Result 222 states and 242 transitions. [2024-10-13 12:53:27,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-13 12:53:27,128 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.416666666666667) internal successors, (65), 13 states have internal predecessors, (65), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 44 [2024-10-13 12:53:27,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:53:27,129 INFO L225 Difference]: With dead ends: 222 [2024-10-13 12:53:27,129 INFO L226 Difference]: Without dead ends: 220 [2024-10-13 12:53:27,129 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=286, Invalid=706, Unknown=0, NotChecked=0, Total=992 [2024-10-13 12:53:27,130 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 254 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 12:53:27,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 84 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 12:53:27,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-10-13 12:53:27,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 182. [2024-10-13 12:53:27,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 177 states have (on average 1.073446327683616) internal successors, (190), 178 states have internal predecessors, (190), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 12:53:27,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 194 transitions. [2024-10-13 12:53:27,139 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 194 transitions. Word has length 44 [2024-10-13 12:53:27,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:53:27,139 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 194 transitions. [2024-10-13 12:53:27,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.416666666666667) internal successors, (65), 13 states have internal predecessors, (65), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-13 12:53:27,140 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 194 transitions. [2024-10-13 12:53:27,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-13 12:53:27,140 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:53:27,140 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 9, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-10-13 12:53:27,153 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-13 12:53:27,340 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,SelfDestructingSolverStorable13 [2024-10-13 12:53:27,341 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-13 12:53:27,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:53:27,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1526754893, now seen corresponding path program 4 times [2024-10-13 12:53:27,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:53:27,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138697797] [2024-10-13 12:53:27,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:53:27,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:53:27,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:53:27,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 12:53:27,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:53:27,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 12:53:27,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:53:27,453 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 181 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-10-13 12:53:27,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:53:27,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138697797] [2024-10-13 12:53:27,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138697797] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 12:53:27,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1926646441] [2024-10-13 12:53:27,453 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-13 12:53:27,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:53:27,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:53:27,455 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-13 12:53:27,456 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-13 12:53:27,511 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-13 12:53:27,511 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 12:53:27,512 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 12:53:27,513 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:53:27,644 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 139 proven. 70 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-13 12:53:27,645 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:53:27,751 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 139 proven. 70 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-13 12:53:27,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1926646441] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:53:27,752 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 12:53:27,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 11] total 21 [2024-10-13 12:53:27,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672681779] [2024-10-13 12:53:27,752 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 12:53:27,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-13 12:53:27,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:53:27,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-13 12:53:27,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2024-10-13 12:53:27,753 INFO L87 Difference]: Start difference. First operand 182 states and 194 transitions. Second operand has 21 states, 21 states have (on average 4.761904761904762) internal successors, (100), 21 states have internal predecessors, (100), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 12:53:28,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:53:28,459 INFO L93 Difference]: Finished difference Result 573 states and 622 transitions. [2024-10-13 12:53:28,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-10-13 12:53:28,459 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.761904761904762) internal successors, (100), 21 states have internal predecessors, (100), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 68 [2024-10-13 12:53:28,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:53:28,461 INFO L225 Difference]: With dead ends: 573 [2024-10-13 12:53:28,461 INFO L226 Difference]: Without dead ends: 448 [2024-10-13 12:53:28,462 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 120 SyntacticMatches, 5 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 724 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=571, Invalid=2081, Unknown=0, NotChecked=0, Total=2652 [2024-10-13 12:53:28,462 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 918 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 918 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 12:53:28,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [918 Valid, 153 Invalid, 714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 12:53:28,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2024-10-13 12:53:28,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 370. [2024-10-13 12:53:28,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 365 states have (on average 1.0712328767123287) internal successors, (391), 366 states have internal predecessors, (391), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 12:53:28,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 395 transitions. [2024-10-13 12:53:28,482 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 395 transitions. Word has length 68 [2024-10-13 12:53:28,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:53:28,482 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 395 transitions. [2024-10-13 12:53:28,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.761904761904762) internal successors, (100), 21 states have internal predecessors, (100), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 12:53:28,482 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 395 transitions. [2024-10-13 12:53:28,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-13 12:53:28,483 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:53:28,483 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 11, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-10-13 12:53:28,496 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-13 12:53:28,683 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,SelfDestructingSolverStorable14 [2024-10-13 12:53:28,684 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-13 12:53:28,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:53:28,684 INFO L85 PathProgramCache]: Analyzing trace with hash 31996324, now seen corresponding path program 5 times [2024-10-13 12:53:28,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:53:28,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279503506] [2024-10-13 12:53:28,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:53:28,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:53:28,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:53:28,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 12:53:28,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:53:28,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 12:53:28,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:53:28,839 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 0 proven. 305 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-10-13 12:53:28,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:53:28,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279503506] [2024-10-13 12:53:28,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279503506] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 12:53:28,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [245463789] [2024-10-13 12:53:28,840 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-13 12:53:28,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:53:28,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:53:28,841 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 12:53:28,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-13 12:53:29,010 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2024-10-13 12:53:29,011 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 12:53:29,012 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 12:53:29,014 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:53:29,142 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 0 proven. 305 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-10-13 12:53:29,143 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:53:29,266 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 0 proven. 305 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-10-13 12:53:29,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [245463789] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:53:29,267 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 12:53:29,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2024-10-13 12:53:29,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889023656] [2024-10-13 12:53:29,267 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 12:53:29,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-13 12:53:29,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:53:29,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-13 12:53:29,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=252, Unknown=0, NotChecked=0, Total=380 [2024-10-13 12:53:29,268 INFO L87 Difference]: Start difference. First operand 370 states and 395 transitions. Second operand has 20 states, 19 states have (on average 5.842105263157895) internal successors, (111), 20 states have internal predecessors, (111), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-13 12:53:30,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:53:30,056 INFO L93 Difference]: Finished difference Result 1062 states and 1185 transitions. [2024-10-13 12:53:30,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2024-10-13 12:53:30,057 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 5.842105263157895) internal successors, (111), 20 states have internal predecessors, (111), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 82 [2024-10-13 12:53:30,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:53:30,059 INFO L225 Difference]: With dead ends: 1062 [2024-10-13 12:53:30,059 INFO L226 Difference]: Without dead ends: 1060 [2024-10-13 12:53:30,060 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1113 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1167, Invalid=2139, Unknown=0, NotChecked=0, Total=3306 [2024-10-13 12:53:30,061 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 1536 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1536 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 12:53:30,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1536 Valid, 68 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 12:53:30,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1060 states. [2024-10-13 12:53:30,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1060 to 926. [2024-10-13 12:53:30,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 926 states, 921 states have (on average 1.0803474484256244) internal successors, (995), 922 states have internal predecessors, (995), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 12:53:30,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 999 transitions. [2024-10-13 12:53:30,108 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 999 transitions. Word has length 82 [2024-10-13 12:53:30,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:53:30,108 INFO L471 AbstractCegarLoop]: Abstraction has 926 states and 999 transitions. [2024-10-13 12:53:30,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 5.842105263157895) internal successors, (111), 20 states have internal predecessors, (111), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-13 12:53:30,108 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 999 transitions. [2024-10-13 12:53:30,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-13 12:53:30,109 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:53:30,109 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 15, 15, 15, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-10-13 12:53:30,117 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-10-13 12:53:30,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-13 12:53:30,310 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-13 12:53:30,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:53:30,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1276431017, now seen corresponding path program 6 times [2024-10-13 12:53:30,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:53:30,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597472210] [2024-10-13 12:53:30,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:53:30,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:53:30,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:53:30,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 12:53:30,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:53:30,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 12:53:30,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:53:30,551 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 493 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2024-10-13 12:53:30,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:53:30,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597472210] [2024-10-13 12:53:30,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597472210] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 12:53:30,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [593917265] [2024-10-13 12:53:30,551 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-13 12:53:30,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:53:30,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:53:30,554 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 12:53:30,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-10-13 12:53:30,610 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2024-10-13 12:53:30,610 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 12:53:30,611 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-13 12:53:30,613 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:53:30,897 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 334 refuted. 0 times theorem prover too weak. 278 trivial. 0 not checked. [2024-10-13 12:53:30,898 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:53:31,098 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 334 refuted. 0 times theorem prover too weak. 278 trivial. 0 not checked. [2024-10-13 12:53:31,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [593917265] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:53:31,098 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 12:53:31,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8] total 25 [2024-10-13 12:53:31,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937614900] [2024-10-13 12:53:31,098 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 12:53:31,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-13 12:53:31,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:53:31,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-13 12:53:31,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=548, Unknown=0, NotChecked=0, Total=650 [2024-10-13 12:53:31,100 INFO L87 Difference]: Start difference. First operand 926 states and 999 transitions. Second operand has 26 states, 21 states have (on average 4.476190476190476) internal successors, (94), 24 states have internal predecessors, (94), 5 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-13 12:53:31,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:53:31,907 INFO L93 Difference]: Finished difference Result 1246 states and 1351 transitions. [2024-10-13 12:53:31,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-10-13 12:53:31,908 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 21 states have (on average 4.476190476190476) internal successors, (94), 24 states have internal predecessors, (94), 5 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 98 [2024-10-13 12:53:31,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:53:31,908 INFO L225 Difference]: With dead ends: 1246 [2024-10-13 12:53:31,908 INFO L226 Difference]: Without dead ends: 0 [2024-10-13 12:53:31,910 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 720 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=693, Invalid=2277, Unknown=0, NotChecked=0, Total=2970 [2024-10-13 12:53:31,910 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 1133 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1133 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 12:53:31,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1133 Valid, 100 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 12:53:31,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-13 12:53:31,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-13 12:53:31,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:53:31,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-13 12:53:31,911 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 98 [2024-10-13 12:53:31,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:53:31,912 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 12:53:31,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 21 states have (on average 4.476190476190476) internal successors, (94), 24 states have internal predecessors, (94), 5 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-13 12:53:31,912 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-13 12:53:31,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-13 12:53:31,914 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 12 remaining) [2024-10-13 12:53:31,915 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 12 remaining) [2024-10-13 12:53:31,915 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 12 remaining) [2024-10-13 12:53:31,915 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 12 remaining) [2024-10-13 12:53:31,915 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 12 remaining) [2024-10-13 12:53:31,915 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 12 remaining) [2024-10-13 12:53:31,915 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 12 remaining) [2024-10-13 12:53:31,915 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 12 remaining) [2024-10-13 12:53:31,915 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 12 remaining) [2024-10-13 12:53:31,915 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 12 remaining) [2024-10-13 12:53:31,916 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 12 remaining) [2024-10-13 12:53:31,916 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 12 remaining) [2024-10-13 12:53:31,938 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-10-13 12:53:32,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-13 12:53:32,122 INFO L407 BasicCegarLoop]: Path program histogram: [6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:53:32,123 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-13 12:53:42,686 WARN L286 SmtUtils]: Spent 10.26s on a formula simplification. DAG size of input: 345 DAG size of output: 273 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-10-13 12:53:52,451 WARN L286 SmtUtils]: Spent 9.76s on a formula simplification. DAG size of input: 333 DAG size of output: 261 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-10-13 12:53:54,187 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 12:53:54,212 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 12:53:54 BoogieIcfgContainer [2024-10-13 12:53:54,212 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 12:53:54,213 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 12:53:54,213 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 12:53:54,213 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 12:53:54,213 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:53:19" (3/4) ... [2024-10-13 12:53:54,214 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 12:53:54,217 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-13 12:53:54,221 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2024-10-13 12:53:54,221 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-13 12:53:54,221 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-13 12:53:54,221 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-13 12:53:54,298 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 12:53:54,299 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-13 12:53:54,299 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 12:53:54,299 INFO L158 Benchmark]: Toolchain (without parser) took 35096.81ms. Allocated memory was 197.1MB in the beginning and 775.9MB in the end (delta: 578.8MB). Free memory was 116.2MB in the beginning and 282.0MB in the end (delta: -165.8MB). Peak memory consumption was 414.3MB. Max. memory is 16.1GB. [2024-10-13 12:53:54,299 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 197.1MB. Free memory is still 160.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 12:53:54,299 INFO L158 Benchmark]: CACSL2BoogieTranslator took 278.42ms. Allocated memory is still 197.1MB. Free memory was 116.0MB in the beginning and 163.2MB in the end (delta: -47.3MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. [2024-10-13 12:53:54,300 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.61ms. Allocated memory is still 197.1MB. Free memory was 163.2MB in the beginning and 162.0MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 12:53:54,300 INFO L158 Benchmark]: Boogie Preprocessor took 32.56ms. Allocated memory is still 197.1MB. Free memory was 162.0MB in the beginning and 160.1MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 12:53:54,300 INFO L158 Benchmark]: RCFGBuilder took 380.79ms. Allocated memory is still 197.1MB. Free memory was 160.1MB in the beginning and 159.5MB in the end (delta: 567.5kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-13 12:53:54,300 INFO L158 Benchmark]: TraceAbstraction took 34282.69ms. Allocated memory was 197.1MB in the beginning and 775.9MB in the end (delta: 578.8MB). Free memory was 158.4MB in the beginning and 287.2MB in the end (delta: -128.8MB). Peak memory consumption was 467.1MB. Max. memory is 16.1GB. [2024-10-13 12:53:54,301 INFO L158 Benchmark]: Witness Printer took 86.20ms. Allocated memory is still 775.9MB. Free memory was 287.2MB in the beginning and 282.0MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 12:53:54,302 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.11ms. Allocated memory is still 197.1MB. Free memory is still 160.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 278.42ms. Allocated memory is still 197.1MB. Free memory was 116.0MB in the beginning and 163.2MB in the end (delta: -47.3MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.61ms. Allocated memory is still 197.1MB. Free memory was 163.2MB in the beginning and 162.0MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 32.56ms. Allocated memory is still 197.1MB. Free memory was 162.0MB in the beginning and 160.1MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 380.79ms. Allocated memory is still 197.1MB. Free memory was 160.1MB in the beginning and 159.5MB in the end (delta: 567.5kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 34282.69ms. Allocated memory was 197.1MB in the beginning and 775.9MB in the end (delta: 578.8MB). Free memory was 158.4MB in the beginning and 287.2MB in the end (delta: -128.8MB). Peak memory consumption was 467.1MB. Max. memory is 16.1GB. * Witness Printer took 86.20ms. Allocated memory is still 775.9MB. Free memory was 287.2MB in the beginning and 282.0MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 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: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: 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: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: 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 2 procedures, 40 locations, 12 error locations. Started 1 CEGAR loops. OverallTime: 12.1s, OverallIterations: 17, TraceHistogramMax: 16, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5352 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5352 mSDsluCounter, 1125 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 797 mSDsCounter, 668 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2900 IncrementalHoareTripleChecker+Invalid, 3568 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 668 mSolverCounterUnsat, 328 mSDtfsCounter, 2900 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1306 GetRequests, 993 SyntacticMatches, 6 SemanticMatches, 307 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3371 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=926occurred in iteration=16, InterpolantAutomatonStates: 259, 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, 17 MinimizatonAttempts, 935 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 1128 NumberOfCodeBlocks, 1018 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 1584 ConstructedInterpolants, 0 QuantifiedInterpolants, 5492 SizeOfPredicates, 20 NumberOfNonLiveVariables, 1372 ConjunctsInSsa, 76 ConjunctsInUnsatCore, 41 InterpolantComputations, 6 PerfectInterpolantSequences, 1648/4496 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 12 specifications checked. All of them hold - InvariantResult [Line: 48]: Loop Invariant Derived loop invariant: (((((((((((m <= 1000) && (s <= 1499)) && (1 <= i)) && (1 <= j)) && (q <= 999)) && (((long long) i + j) <= 2147483647)) && (n <= 1500)) && (i <= 998)) || ((((((((i == 0) && (1 <= j)) && (j <= 2147483647)) && (q <= 2147483647)) && (((long long) q + s) <= 2147483649)) && (((long long) j + q) <= 2147483649)) || (((((((1 <= i) && (1 <= j)) && (i <= 2147483646)) && (q <= 2147483647)) && (((long long) i + s) <= 2147483648)) && (((long long) q + s) <= 2147483649)) && (((long long) j + q) <= 2147483649))) && (s <= 2147483647))) || (((((((m <= 1000) && (s <= 1499)) && (i == 0)) && (1 <= j)) && (q <= 999)) && (n <= 1500)) && (j <= 2147483647))) || ((((((i == 0) && (j == 0)) && (q <= 2147483647)) && (((long long) q + s) <= 2147483649)) || ((((((1 <= i) && (i <= 2147483646)) && (j == 0)) && (q <= 2147483647)) && (((long long) i + s) <= 2147483648)) && (((long long) q + s) <= 2147483649))) && (s <= 2147483647))) - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: (((((1 <= i) && (s <= 0)) && (q <= 2147483647)) || (((((1 <= i) && (i <= 2147483647)) && (s <= 2147483647)) && (q <= 2147483647)) && (((long long) q + s) <= 2147483649))) || (((((m <= 1000) && (s <= 1499)) && (i == 0)) && (q <= 999)) && (n <= 1500))) - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: ((((1 <= i) && (s <= 0)) && (q <= 2147483647)) || (((((i == 0) && (q <= 2147483647)) && (((long long) q + s) <= 2147483649)) || ((((1 <= i) && (i <= 2147483647)) && (q <= 2147483647)) && (((long long) q + s) <= 2147483649))) && (s <= 2147483647))) - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: ((((((((((((m <= 1000) && (s <= 1499)) && (1 <= i)) && (1 <= j)) && (q <= 999)) && (((long long) i + j) <= 2147483647)) && (n <= 1500)) && (i <= 998)) || (((((((m <= 1000) && (s <= 1499)) && (i == 0)) && (1 <= j)) && (q <= 999)) && (n <= 1500)) && (j <= 2147483647))) || ((((((m <= 1000) && (s <= 1499)) && (i == 0)) && (q <= 999)) && (n <= 1500)) && (j == 0))) || (((((((1 <= i) && (1 <= j)) && (i <= 2147483646)) && (q <= 2147483647)) && (((long long) i + s) <= 2147483648)) && (((long long) q + s) <= 2147483649)) && (((long long) j + q) <= 2147483649))) || ((((((1 <= i) && (i <= 2147483646)) && (j == 0)) && (q <= 2147483647)) && (((long long) i + s) <= 2147483648)) && (((long long) q + s) <= 2147483649))) - ProcedureContractResult [Line: 5]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (cond != 0) RESULT: Ultimate proved your program to be correct! [2024-10-13 12:53:54,331 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