./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/array-tiling/pnr5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-tiling/pnr5.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 c6dc18f387244e600c9c46c5a67fb3c0c9875a9a14eb13d3a621343f4a214b0b --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 11:03:49,517 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 11:03:49,573 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-09 11:03:49,577 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 11:03:49,578 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 11:03:49,602 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 11:03:49,602 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 11:03:49,603 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 11:03:49,604 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 11:03:49,605 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 11:03:49,605 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 11:03:49,605 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 11:03:49,606 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 11:03:49,607 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 11:03:49,607 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 11:03:49,608 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 11:03:49,608 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 11:03:49,608 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 11:03:49,608 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 11:03:49,609 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 11:03:49,609 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 11:03:49,610 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 11:03:49,610 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 11:03:49,613 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 11:03:49,613 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 11:03:49,614 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-09 11:03:49,614 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 11:03:49,614 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 11:03:49,614 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 11:03:49,615 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 11:03:49,616 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 11:03:49,616 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 11:03:49,617 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 11:03:49,617 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 11:03:49,617 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 11:03:49,617 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 11:03:49,617 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 11:03:49,618 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 11:03:49,618 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 11:03:49,618 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 11:03:49,618 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 11:03:49,619 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 11:03:49,619 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 11:03:49,619 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 11:03:49,620 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 -> c6dc18f387244e600c9c46c5a67fb3c0c9875a9a14eb13d3a621343f4a214b0b [2024-11-09 11:03:49,898 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 11:03:49,924 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 11:03:49,928 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 11:03:49,930 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 11:03:49,930 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 11:03:49,931 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-tiling/pnr5.c [2024-11-09 11:03:51,360 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 11:03:51,572 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 11:03:51,573 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/pnr5.c [2024-11-09 11:03:51,581 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/755a1c74b/6feb1201ace641e5a04403b2f93e944c/FLAG7e4808942 [2024-11-09 11:03:51,594 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/755a1c74b/6feb1201ace641e5a04403b2f93e944c [2024-11-09 11:03:51,597 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 11:03:51,598 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 11:03:51,601 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 11:03:51,602 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 11:03:51,607 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 11:03:51,608 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:03:51" (1/1) ... [2024-11-09 11:03:51,609 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c2ea67d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:03:51, skipping insertion in model container [2024-11-09 11:03:51,609 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:03:51" (1/1) ... [2024-11-09 11:03:51,634 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 11:03:51,865 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 11:03:51,876 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 11:03:51,898 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 11:03:51,919 INFO L204 MainTranslator]: Completed translation [2024-11-09 11:03:51,919 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:03:51 WrapperNode [2024-11-09 11:03:51,919 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 11:03:51,920 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 11:03:51,921 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 11:03:51,921 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 11:03:51,927 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:03:51" (1/1) ... [2024-11-09 11:03:51,934 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:03:51" (1/1) ... [2024-11-09 11:03:51,962 INFO L138 Inliner]: procedures = 17, calls = 34, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 146 [2024-11-09 11:03:51,962 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 11:03:51,963 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 11:03:51,963 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 11:03:51,963 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 11:03:51,974 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:03:51" (1/1) ... [2024-11-09 11:03:51,974 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:03:51" (1/1) ... [2024-11-09 11:03:51,977 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:03:51" (1/1) ... [2024-11-09 11:03:52,000 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 7, 11]. 55 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7, 0]. The 10 writes are split as follows [0, 0, 10]. [2024-11-09 11:03:52,002 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:03:51" (1/1) ... [2024-11-09 11:03:52,002 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:03:51" (1/1) ... [2024-11-09 11:03:52,010 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:03:51" (1/1) ... [2024-11-09 11:03:52,014 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:03:51" (1/1) ... [2024-11-09 11:03:52,015 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:03:51" (1/1) ... [2024-11-09 11:03:52,017 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:03:51" (1/1) ... [2024-11-09 11:03:52,019 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 11:03:52,020 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 11:03:52,020 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 11:03:52,020 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 11:03:52,021 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:03:51" (1/1) ... [2024-11-09 11:03:52,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 11:03:52,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:03:52,067 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 11:03:52,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 11:03:52,123 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 11:03:52,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 11:03:52,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 11:03:52,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 11:03:52,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 11:03:52,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 11:03:52,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 11:03:52,124 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 11:03:52,125 INFO L130 BoogieDeclarations]: Found specification of procedure ReadFromPort [2024-11-09 11:03:52,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ReadFromPort [2024-11-09 11:03:52,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 11:03:52,127 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 11:03:52,127 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 11:03:52,127 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 11:03:52,127 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 11:03:52,214 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 11:03:52,216 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 11:03:52,715 INFO L? ?]: Removed 67 outVars from TransFormulas that were not future-live. [2024-11-09 11:03:52,716 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 11:03:52,738 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 11:03:52,740 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-09 11:03:52,741 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:03:52 BoogieIcfgContainer [2024-11-09 11:03:52,741 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 11:03:52,743 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 11:03:52,744 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 11:03:52,748 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 11:03:52,749 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 11:03:51" (1/3) ... [2024-11-09 11:03:52,749 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@797f6e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:03:52, skipping insertion in model container [2024-11-09 11:03:52,750 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:03:51" (2/3) ... [2024-11-09 11:03:52,751 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@797f6e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:03:52, skipping insertion in model container [2024-11-09 11:03:52,751 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:03:52" (3/3) ... [2024-11-09 11:03:52,753 INFO L112 eAbstractionObserver]: Analyzing ICFG pnr5.c [2024-11-09 11:03:52,769 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 11:03:52,770 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 46 error locations. [2024-11-09 11:03:52,839 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 11:03:52,846 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;@b1d2c17, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 11:03:52,847 INFO L334 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2024-11-09 11:03:52,852 INFO L276 IsEmpty]: Start isEmpty. Operand has 130 states, 77 states have (on average 1.7662337662337662) internal successors, (136), 123 states have internal predecessors, (136), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 11:03:52,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 11:03:52,858 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:03:52,859 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:03:52,860 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2024-11-09 11:03:52,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:03:52,866 INFO L85 PathProgramCache]: Analyzing trace with hash -655793907, now seen corresponding path program 1 times [2024-11-09 11:03:52,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:03:52,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104727043] [2024-11-09 11:03:52,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:03:52,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:03:53,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:53,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:03:53,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:03:53,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104727043] [2024-11-09 11:03:53,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104727043] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:03:53,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:03:53,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:03:53,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552696422] [2024-11-09 11:03:53,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:03:53,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:03:53,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:03:53,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:03:53,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:03:53,347 INFO L87 Difference]: Start difference. First operand has 130 states, 77 states have (on average 1.7662337662337662) internal successors, (136), 123 states have internal predecessors, (136), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:03:53,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:03:53,474 INFO L93 Difference]: Finished difference Result 260 states and 288 transitions. [2024-11-09 11:03:53,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:03:53,479 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-09 11:03:53,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:03:53,489 INFO L225 Difference]: With dead ends: 260 [2024-11-09 11:03:53,490 INFO L226 Difference]: Without dead ends: 122 [2024-11-09 11:03:53,494 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-11-09 11:03:53,500 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 255 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:03:53,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 139 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:03:53,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-09 11:03:53,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-11-09 11:03:53,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 71 states have (on average 1.7183098591549295) internal successors, (122), 115 states have internal predecessors, (122), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 11:03:53,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 132 transitions. [2024-11-09 11:03:53,554 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 132 transitions. Word has length 7 [2024-11-09 11:03:53,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:03:53,555 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 132 transitions. [2024-11-09 11:03:53,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:03:53,555 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 132 transitions. [2024-11-09 11:03:53,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 11:03:53,556 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:03:53,556 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:03:53,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 11:03:53,556 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2024-11-09 11:03:53,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:03:53,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1145225419, now seen corresponding path program 1 times [2024-11-09 11:03:53,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:03:53,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393247594] [2024-11-09 11:03:53,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:03:53,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:03:53,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:53,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:03:53,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:03:53,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393247594] [2024-11-09 11:03:53,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393247594] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:03:53,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:03:53,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 11:03:53,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992285265] [2024-11-09 11:03:53,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:03:53,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 11:03:53,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:03:53,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 11:03:53,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 11:03:53,818 INFO L87 Difference]: Start difference. First operand 122 states and 132 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:03:53,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:03:53,962 INFO L93 Difference]: Finished difference Result 122 states and 132 transitions. [2024-11-09 11:03:53,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 11:03:53,963 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-09 11:03:53,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:03:53,964 INFO L225 Difference]: With dead ends: 122 [2024-11-09 11:03:53,964 INFO L226 Difference]: Without dead ends: 121 [2024-11-09 11:03:53,964 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-09 11:03:53,966 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 471 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:03:53,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 124 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:03:53,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-09 11:03:53,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-11-09 11:03:53,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 71 states have (on average 1.704225352112676) internal successors, (121), 114 states have internal predecessors, (121), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 11:03:53,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 131 transitions. [2024-11-09 11:03:53,985 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 131 transitions. Word has length 8 [2024-11-09 11:03:53,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:03:53,985 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 131 transitions. [2024-11-09 11:03:53,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:03:53,985 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 131 transitions. [2024-11-09 11:03:53,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 11:03:53,986 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:03:53,986 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:03:53,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 11:03:53,987 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2024-11-09 11:03:53,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:03:53,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1891388324, now seen corresponding path program 1 times [2024-11-09 11:03:53,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:03:53,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734468489] [2024-11-09 11:03:53,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:03:53,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:03:54,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:54,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:03:54,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:03:54,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734468489] [2024-11-09 11:03:54,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734468489] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:03:54,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:03:54,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:03:54,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073362530] [2024-11-09 11:03:54,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:03:54,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:03:54,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:03:54,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:03:54,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:03:54,122 INFO L87 Difference]: Start difference. First operand 121 states and 131 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:03:54,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:03:54,353 INFO L93 Difference]: Finished difference Result 129 states and 139 transitions. [2024-11-09 11:03:54,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:03:54,353 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-09 11:03:54,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:03:54,355 INFO L225 Difference]: With dead ends: 129 [2024-11-09 11:03:54,355 INFO L226 Difference]: Without dead ends: 127 [2024-11-09 11:03:54,358 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:03:54,359 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 1 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 11:03:54,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 290 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 11:03:54,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-09 11:03:54,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2024-11-09 11:03:54,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 77 states have (on average 1.6493506493506493) internal successors, (127), 120 states have internal predecessors, (127), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 11:03:54,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 137 transitions. [2024-11-09 11:03:54,374 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 137 transitions. Word has length 15 [2024-11-09 11:03:54,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:03:54,375 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 137 transitions. [2024-11-09 11:03:54,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:03:54,375 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 137 transitions. [2024-11-09 11:03:54,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 11:03:54,376 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:03:54,376 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:03:54,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 11:03:54,376 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2024-11-09 11:03:54,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:03:54,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1511795153, now seen corresponding path program 1 times [2024-11-09 11:03:54,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:03:54,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142849520] [2024-11-09 11:03:54,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:03:54,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:03:54,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:54,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 11:03:54,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:54,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:03:54,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:03:54,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142849520] [2024-11-09 11:03:54,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142849520] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:03:54,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:03:54,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 11:03:54,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725071986] [2024-11-09 11:03:54,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:03:54,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 11:03:54,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:03:54,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 11:03:54,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:03:54,430 INFO L87 Difference]: Start difference. First operand 127 states and 137 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 11:03:54,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:03:54,640 INFO L93 Difference]: Finished difference Result 226 states and 247 transitions. [2024-11-09 11:03:54,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 11:03:54,641 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-11-09 11:03:54,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:03:54,643 INFO L225 Difference]: With dead ends: 226 [2024-11-09 11:03:54,645 INFO L226 Difference]: Without dead ends: 186 [2024-11-09 11:03:54,646 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:03:54,647 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 53 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 11:03:54,647 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 128 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 11:03:54,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-09 11:03:54,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 185. [2024-11-09 11:03:54,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 130 states have (on average 1.4307692307692308) internal successors, (186), 173 states have internal predecessors, (186), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-09 11:03:54,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 206 transitions. [2024-11-09 11:03:54,661 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 206 transitions. Word has length 16 [2024-11-09 11:03:54,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:03:54,662 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 206 transitions. [2024-11-09 11:03:54,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 11:03:54,663 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 206 transitions. [2024-11-09 11:03:54,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 11:03:54,663 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:03:54,664 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:03:54,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 11:03:54,666 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2024-11-09 11:03:54,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:03:54,669 INFO L85 PathProgramCache]: Analyzing trace with hash 798187119, now seen corresponding path program 1 times [2024-11-09 11:03:54,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:03:54,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589711394] [2024-11-09 11:03:54,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:03:54,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:03:54,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:54,848 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 11:03:54,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:03:54,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589711394] [2024-11-09 11:03:54,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589711394] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:03:54,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:03:54,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 11:03:54,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111616629] [2024-11-09 11:03:54,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:03:54,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:03:54,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:03:54,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:03:54,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:03:54,851 INFO L87 Difference]: Start difference. First operand 185 states and 206 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:03:55,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:03:55,096 INFO L93 Difference]: Finished difference Result 201 states and 222 transitions. [2024-11-09 11:03:55,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 11:03:55,096 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-09 11:03:55,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:03:55,097 INFO L225 Difference]: With dead ends: 201 [2024-11-09 11:03:55,097 INFO L226 Difference]: Without dead ends: 186 [2024-11-09 11:03:55,098 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:03:55,099 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 243 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 11:03:55,099 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 105 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 11:03:55,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-09 11:03:55,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 185. [2024-11-09 11:03:55,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 130 states have (on average 1.4230769230769231) internal successors, (185), 173 states have internal predecessors, (185), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-09 11:03:55,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 205 transitions. [2024-11-09 11:03:55,111 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 205 transitions. Word has length 21 [2024-11-09 11:03:55,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:03:55,111 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 205 transitions. [2024-11-09 11:03:55,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:03:55,112 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 205 transitions. [2024-11-09 11:03:55,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-09 11:03:55,113 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:03:55,113 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:03:55,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 11:03:55,113 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2024-11-09 11:03:55,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:03:55,116 INFO L85 PathProgramCache]: Analyzing trace with hash -665772949, now seen corresponding path program 1 times [2024-11-09 11:03:55,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:03:55,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95703916] [2024-11-09 11:03:55,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:03:55,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:03:55,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:55,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 11:03:55,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:55,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 11:03:55,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:55,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 11:03:55,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:55,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 11:03:55,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:55,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 11:03:55,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:55,284 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-09 11:03:55,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:03:55,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95703916] [2024-11-09 11:03:55,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95703916] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:03:55,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:03:55,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:03:55,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054369838] [2024-11-09 11:03:55,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:03:55,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:03:55,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:03:55,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:03:55,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:03:55,287 INFO L87 Difference]: Start difference. First operand 185 states and 205 transitions. Second operand has 4 states, 3 states have (on average 14.333333333333334) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 11:03:55,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:03:55,471 INFO L93 Difference]: Finished difference Result 190 states and 210 transitions. [2024-11-09 11:03:55,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:03:55,471 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 14.333333333333334) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 61 [2024-11-09 11:03:55,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:03:55,473 INFO L225 Difference]: With dead ends: 190 [2024-11-09 11:03:55,473 INFO L226 Difference]: Without dead ends: 188 [2024-11-09 11:03:55,473 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:03:55,474 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 26 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 11:03:55,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 210 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 11:03:55,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-11-09 11:03:55,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2024-11-09 11:03:55,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 133 states have (on average 1.413533834586466) internal successors, (188), 176 states have internal predecessors, (188), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-09 11:03:55,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 208 transitions. [2024-11-09 11:03:55,503 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 208 transitions. Word has length 61 [2024-11-09 11:03:55,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:03:55,504 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 208 transitions. [2024-11-09 11:03:55,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 14.333333333333334) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 11:03:55,505 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 208 transitions. [2024-11-09 11:03:55,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-09 11:03:55,510 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:03:55,510 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:03:55,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 11:03:55,511 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2024-11-09 11:03:55,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:03:55,513 INFO L85 PathProgramCache]: Analyzing trace with hash 589469717, now seen corresponding path program 1 times [2024-11-09 11:03:55,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:03:55,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187595706] [2024-11-09 11:03:55,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:03:55,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:03:55,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:55,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 11:03:55,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:55,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 11:03:55,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:55,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 11:03:55,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:55,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 11:03:55,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:55,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 11:03:55,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:55,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 11:03:55,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:55,728 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-09 11:03:55,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:03:55,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187595706] [2024-11-09 11:03:55,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187595706] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:03:55,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1122201089] [2024-11-09 11:03:55,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:03:55,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:03:55,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:03:55,731 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:03:55,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 11:03:55,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:55,832 INFO L255 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 11:03:55,841 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:03:55,979 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-09 11:03:55,979 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:03:55,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1122201089] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:03:55,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 11:03:55,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-11-09 11:03:55,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915452552] [2024-11-09 11:03:55,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:03:55,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:03:55,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:03:55,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:03:55,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-09 11:03:55,981 INFO L87 Difference]: Start difference. First operand 188 states and 208 transitions. Second operand has 5 states, 4 states have (on average 12.5) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-09 11:03:56,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:03:56,203 INFO L93 Difference]: Finished difference Result 188 states and 208 transitions. [2024-11-09 11:03:56,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 11:03:56,204 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 12.5) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 72 [2024-11-09 11:03:56,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:03:56,207 INFO L225 Difference]: With dead ends: 188 [2024-11-09 11:03:56,207 INFO L226 Difference]: Without dead ends: 167 [2024-11-09 11:03:56,208 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-09 11:03:56,208 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 78 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 11:03:56,208 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 178 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 11:03:56,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-11-09 11:03:56,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2024-11-09 11:03:56,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 133 states have (on average 1.255639097744361) internal successors, (167), 155 states have internal predecessors, (167), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-09 11:03:56,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 187 transitions. [2024-11-09 11:03:56,226 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 187 transitions. Word has length 72 [2024-11-09 11:03:56,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:03:56,226 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 187 transitions. [2024-11-09 11:03:56,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 12.5) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-09 11:03:56,227 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 187 transitions. [2024-11-09 11:03:56,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-09 11:03:56,231 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:03:56,231 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:03:56,249 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 11:03:56,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:03:56,432 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2024-11-09 11:03:56,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:03:56,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1093692113, now seen corresponding path program 1 times [2024-11-09 11:03:56,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:03:56,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235379234] [2024-11-09 11:03:56,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:03:56,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:03:56,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:56,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 11:03:56,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:56,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 11:03:56,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:56,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 11:03:56,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:56,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 11:03:56,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:56,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 11:03:56,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:56,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 11:03:56,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:56,588 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-09 11:03:56,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:03:56,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235379234] [2024-11-09 11:03:56,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235379234] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:03:56,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1192190139] [2024-11-09 11:03:56,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:03:56,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:03:56,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:03:56,591 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:03:56,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 11:03:56,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:56,677 INFO L255 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 11:03:56,679 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:03:56,779 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-09 11:03:56,779 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:03:56,914 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-09 11:03:56,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1192190139] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:03:56,914 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:03:56,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2024-11-09 11:03:56,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369276649] [2024-11-09 11:03:56,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:03:56,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 11:03:56,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:03:56,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 11:03:56,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-09 11:03:56,916 INFO L87 Difference]: Start difference. First operand 167 states and 187 transitions. Second operand has 10 states, 9 states have (on average 14.666666666666666) internal successors, (132), 10 states have internal predecessors, (132), 5 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2024-11-09 11:03:57,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:03:57,190 INFO L93 Difference]: Finished difference Result 241 states and 295 transitions. [2024-11-09 11:03:57,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 11:03:57,191 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 14.666666666666666) internal successors, (132), 10 states have internal predecessors, (132), 5 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) Word has length 73 [2024-11-09 11:03:57,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:03:57,193 INFO L225 Difference]: With dead ends: 241 [2024-11-09 11:03:57,193 INFO L226 Difference]: Without dead ends: 220 [2024-11-09 11:03:57,194 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-09 11:03:57,194 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 157 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 11:03:57,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 238 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 11:03:57,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-11-09 11:03:57,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2024-11-09 11:03:57,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 198 states have (on average 1.121212121212121) internal successors, (222), 202 states have internal predecessors, (222), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 11:03:57,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 254 transitions. [2024-11-09 11:03:57,205 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 254 transitions. Word has length 73 [2024-11-09 11:03:57,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:03:57,205 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 254 transitions. [2024-11-09 11:03:57,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 14.666666666666666) internal successors, (132), 10 states have internal predecessors, (132), 5 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2024-11-09 11:03:57,205 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 254 transitions. [2024-11-09 11:03:57,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-09 11:03:57,207 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:03:57,207 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:03:57,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 11:03:57,407 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,SelfDestructingSolverStorable7 [2024-11-09 11:03:57,408 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2024-11-09 11:03:57,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:03:57,408 INFO L85 PathProgramCache]: Analyzing trace with hash 685759561, now seen corresponding path program 1 times [2024-11-09 11:03:57,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:03:57,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060626292] [2024-11-09 11:03:57,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:03:57,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:03:57,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:57,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 11:03:57,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:57,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 11:03:57,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:57,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 11:03:57,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:57,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 11:03:57,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:57,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 11:03:57,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:57,546 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-09 11:03:57,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:03:57,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060626292] [2024-11-09 11:03:57,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060626292] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:03:57,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [722625623] [2024-11-09 11:03:57,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:03:57,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:03:57,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:03:57,550 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:03:57,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 11:03:57,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:57,631 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 11:03:57,633 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:03:57,666 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-09 11:03:57,667 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:03:57,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [722625623] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:03:57,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 11:03:57,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-11-09 11:03:57,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13855073] [2024-11-09 11:03:57,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:03:57,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 11:03:57,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:03:57,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 11:03:57,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-09 11:03:57,669 INFO L87 Difference]: Start difference. First operand 220 states and 254 transitions. Second operand has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 11:03:57,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:03:57,845 INFO L93 Difference]: Finished difference Result 220 states and 254 transitions. [2024-11-09 11:03:57,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 11:03:57,845 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 77 [2024-11-09 11:03:57,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:03:57,847 INFO L225 Difference]: With dead ends: 220 [2024-11-09 11:03:57,847 INFO L226 Difference]: Without dead ends: 219 [2024-11-09 11:03:57,847 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-09 11:03:57,848 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 117 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 11:03:57,848 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 172 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 11:03:57,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-11-09 11:03:57,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2024-11-09 11:03:57,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 198 states have (on average 1.1161616161616161) internal successors, (221), 201 states have internal predecessors, (221), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 11:03:57,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 253 transitions. [2024-11-09 11:03:57,864 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 253 transitions. Word has length 77 [2024-11-09 11:03:57,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:03:57,865 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 253 transitions. [2024-11-09 11:03:57,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 11:03:57,865 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 253 transitions. [2024-11-09 11:03:57,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-09 11:03:57,867 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:03:57,867 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:03:57,885 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 11:03:58,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:03:58,069 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2024-11-09 11:03:58,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:03:58,070 INFO L85 PathProgramCache]: Analyzing trace with hash -216289874, now seen corresponding path program 1 times [2024-11-09 11:03:58,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:03:58,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763090904] [2024-11-09 11:03:58,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:03:58,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:03:58,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:58,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 11:03:58,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:58,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 11:03:58,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:58,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 11:03:58,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:58,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 11:03:58,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:58,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 11:03:58,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:58,180 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-09 11:03:58,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:03:58,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763090904] [2024-11-09 11:03:58,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763090904] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:03:58,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1289975086] [2024-11-09 11:03:58,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:03:58,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:03:58,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:03:58,183 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:03:58,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 11:03:58,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:58,262 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 11:03:58,264 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:03:58,296 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-09 11:03:58,296 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:03:58,359 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-09 11:03:58,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1289975086] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:03:58,360 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:03:58,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-11-09 11:03:58,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466171296] [2024-11-09 11:03:58,361 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:03:58,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 11:03:58,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:03:58,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 11:03:58,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-11-09 11:03:58,363 INFO L87 Difference]: Start difference. First operand 219 states and 253 transitions. Second operand has 12 states, 11 states have (on average 7.090909090909091) internal successors, (78), 12 states have internal predecessors, (78), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 11:03:58,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:03:58,622 INFO L93 Difference]: Finished difference Result 238 states and 274 transitions. [2024-11-09 11:03:58,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 11:03:58,622 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.090909090909091) internal successors, (78), 12 states have internal predecessors, (78), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 78 [2024-11-09 11:03:58,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:03:58,624 INFO L225 Difference]: With dead ends: 238 [2024-11-09 11:03:58,624 INFO L226 Difference]: Without dead ends: 237 [2024-11-09 11:03:58,624 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-11-09 11:03:58,625 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 164 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 11:03:58,625 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 268 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 11:03:58,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-11-09 11:03:58,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2024-11-09 11:03:58,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 216 states have (on average 1.1064814814814814) internal successors, (239), 219 states have internal predecessors, (239), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 11:03:58,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 271 transitions. [2024-11-09 11:03:58,636 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 271 transitions. Word has length 78 [2024-11-09 11:03:58,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:03:58,637 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 271 transitions. [2024-11-09 11:03:58,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.090909090909091) internal successors, (78), 12 states have internal predecessors, (78), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 11:03:58,637 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 271 transitions. [2024-11-09 11:03:58,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-09 11:03:58,638 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:03:58,638 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:03:58,656 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 11:03:58,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:03:58,840 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2024-11-09 11:03:58,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:03:58,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1576425109, now seen corresponding path program 2 times [2024-11-09 11:03:58,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:03:58,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981781902] [2024-11-09 11:03:58,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:03:58,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:03:58,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:59,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 11:03:59,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:59,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 11:03:59,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:59,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 11:03:59,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:59,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 11:03:59,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:59,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 11:03:59,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:59,073 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-09 11:03:59,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:03:59,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981781902] [2024-11-09 11:03:59,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981781902] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:03:59,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403258562] [2024-11-09 11:03:59,073 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 11:03:59,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:03:59,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:03:59,076 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:03:59,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 11:03:59,146 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-09 11:03:59,146 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 11:03:59,147 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 11:03:59,153 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:03:59,297 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-11-09 11:03:59,297 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:03:59,422 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-11-09 11:03:59,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1403258562] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:03:59,423 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:03:59,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 4, 4] total 14 [2024-11-09 11:03:59,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100724416] [2024-11-09 11:03:59,423 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:03:59,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 11:03:59,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:03:59,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 11:03:59,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2024-11-09 11:03:59,425 INFO L87 Difference]: Start difference. First operand 237 states and 271 transitions. Second operand has 15 states, 14 states have (on average 9.5) internal successors, (133), 15 states have internal predecessors, (133), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-09 11:03:59,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:03:59,832 INFO L93 Difference]: Finished difference Result 244 states and 279 transitions. [2024-11-09 11:03:59,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 11:03:59,833 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 9.5) internal successors, (133), 15 states have internal predecessors, (133), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 96 [2024-11-09 11:03:59,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:03:59,834 INFO L225 Difference]: With dead ends: 244 [2024-11-09 11:03:59,834 INFO L226 Difference]: Without dead ends: 205 [2024-11-09 11:03:59,835 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 198 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=537, Unknown=0, NotChecked=0, Total=702 [2024-11-09 11:03:59,835 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 166 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 11:03:59,836 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 248 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 11:03:59,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-11-09 11:03:59,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2024-11-09 11:03:59,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 185 states have (on average 1.1027027027027028) internal successors, (204), 187 states have internal predecessors, (204), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 11:03:59,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 236 transitions. [2024-11-09 11:03:59,845 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 236 transitions. Word has length 96 [2024-11-09 11:03:59,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:03:59,845 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 236 transitions. [2024-11-09 11:03:59,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 9.5) internal successors, (133), 15 states have internal predecessors, (133), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-09 11:03:59,846 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 236 transitions. [2024-11-09 11:03:59,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-09 11:03:59,847 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:03:59,848 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:03:59,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-09 11:04:00,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-09 11:04:00,049 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2024-11-09 11:04:00,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:04:00,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1271645819, now seen corresponding path program 1 times [2024-11-09 11:04:00,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:04:00,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731983221] [2024-11-09 11:04:00,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:04:00,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:04:00,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:04:00,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 11:04:00,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:04:00,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 11:04:00,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:04:00,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 11:04:00,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:04:00,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 11:04:00,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:04:00,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 11:04:00,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:04:00,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 11:04:00,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:04:00,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-09 11:04:00,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:04:00,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-09 11:04:00,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:04:00,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 11:04:00,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:04:00,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-09 11:04:00,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:04:00,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-09 11:04:00,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:04:00,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-09 11:04:00,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:04:00,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-09 11:04:00,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:04:00,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-09 11:04:00,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:04:00,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-09 11:04:00,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:04:00,237 INFO L134 CoverageAnalysis]: Checked inductivity of 438 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked. [2024-11-09 11:04:00,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:04:00,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731983221] [2024-11-09 11:04:00,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731983221] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:04:00,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:04:00,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:04:00,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933896939] [2024-11-09 11:04:00,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:04:00,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:04:00,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:04:00,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:04:00,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:04:00,240 INFO L87 Difference]: Start difference. First operand 205 states and 236 transitions. Second operand has 4 states, 3 states have (on average 24.666666666666668) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-09 11:04:00,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:04:00,325 INFO L93 Difference]: Finished difference Result 205 states and 236 transitions. [2024-11-09 11:04:00,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:04:00,326 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 24.666666666666668) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 174 [2024-11-09 11:04:00,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:04:00,328 INFO L225 Difference]: With dead ends: 205 [2024-11-09 11:04:00,328 INFO L226 Difference]: Without dead ends: 204 [2024-11-09 11:04:00,328 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:04:00,329 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 31 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:04:00,329 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 89 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:04:00,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-11-09 11:04:00,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2024-11-09 11:04:00,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 185 states have (on average 1.0972972972972972) internal successors, (203), 186 states have internal predecessors, (203), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 11:04:00,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 235 transitions. [2024-11-09 11:04:00,341 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 235 transitions. Word has length 174 [2024-11-09 11:04:00,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:04:00,342 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 235 transitions. [2024-11-09 11:04:00,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 24.666666666666668) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-09 11:04:00,342 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 235 transitions. [2024-11-09 11:04:00,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-11-09 11:04:00,344 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:04:00,344 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:04:00,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 11:04:00,345 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2024-11-09 11:04:00,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:04:00,345 INFO L85 PathProgramCache]: Analyzing trace with hash -848667003, now seen corresponding path program 2 times [2024-11-09 11:04:00,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:04:00,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354224563] [2024-11-09 11:04:00,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:04:00,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:04:00,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:04:00,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 11:04:00,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:04:00,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 11:04:00,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:04:00,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 11:04:00,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:04:00,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 11:04:00,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:04:00,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 11:04:00,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:04:00,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 11:04:00,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:04:00,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-09 11:04:00,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:04:00,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-09 11:04:00,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:04:00,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 11:04:00,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:04:00,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-09 11:04:00,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:04:00,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-09 11:04:00,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:04:00,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-09 11:04:00,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:04:00,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-09 11:04:00,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:04:00,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-09 11:04:00,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:04:00,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-09 11:04:00,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:04:00,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-09 11:04:00,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:04:00,891 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 489 trivial. 0 not checked. [2024-11-09 11:04:00,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:04:00,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354224563] [2024-11-09 11:04:00,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354224563] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:04:00,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [900958330] [2024-11-09 11:04:00,893 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 11:04:00,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:04:00,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:04:00,896 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:04:00,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 11:04:00,983 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-09 11:04:00,983 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 11:04:00,984 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 11:04:00,987 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:04:01,567 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 447 trivial. 0 not checked. [2024-11-09 11:04:01,568 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:04:01,897 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 492 trivial. 0 not checked. [2024-11-09 11:04:01,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [900958330] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:04:01,898 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:04:01,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 3] total 11 [2024-11-09 11:04:01,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8306017] [2024-11-09 11:04:01,899 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:04:01,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 11:04:01,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:04:01,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 11:04:01,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-11-09 11:04:01,901 INFO L87 Difference]: Start difference. First operand 204 states and 235 transitions. Second operand has 12 states, 11 states have (on average 12.818181818181818) internal successors, (141), 12 states have internal predecessors, (141), 5 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2024-11-09 11:04:02,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:04:02,070 INFO L93 Difference]: Finished difference Result 204 states and 235 transitions. [2024-11-09 11:04:02,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 11:04:02,070 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 12.818181818181818) internal successors, (141), 12 states have internal predecessors, (141), 5 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) Word has length 185 [2024-11-09 11:04:02,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:04:02,071 INFO L225 Difference]: With dead ends: 204 [2024-11-09 11:04:02,071 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 11:04:02,072 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 397 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2024-11-09 11:04:02,074 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 379 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:04:02,074 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 48 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:04:02,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 11:04:02,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 11:04:02,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:04:02,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 11:04:02,075 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 185 [2024-11-09 11:04:02,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:04:02,075 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 11:04:02,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 12.818181818181818) internal successors, (141), 12 states have internal predecessors, (141), 5 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2024-11-09 11:04:02,076 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 11:04:02,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 11:04:02,080 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 46 remaining) [2024-11-09 11:04:02,081 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 46 remaining) [2024-11-09 11:04:02,081 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 46 remaining) [2024-11-09 11:04:02,081 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 46 remaining) [2024-11-09 11:04:02,081 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 46 remaining) [2024-11-09 11:04:02,081 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 46 remaining) [2024-11-09 11:04:02,081 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 46 remaining) [2024-11-09 11:04:02,081 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 46 remaining) [2024-11-09 11:04:02,081 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 46 remaining) [2024-11-09 11:04:02,082 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 46 remaining) [2024-11-09 11:04:02,082 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 46 remaining) [2024-11-09 11:04:02,082 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 46 remaining) [2024-11-09 11:04:02,082 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 46 remaining) [2024-11-09 11:04:02,082 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 46 remaining) [2024-11-09 11:04:02,082 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 46 remaining) [2024-11-09 11:04:02,082 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 46 remaining) [2024-11-09 11:04:02,082 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 46 remaining) [2024-11-09 11:04:02,082 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 46 remaining) [2024-11-09 11:04:02,082 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 46 remaining) [2024-11-09 11:04:02,082 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 46 remaining) [2024-11-09 11:04:02,083 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 46 remaining) [2024-11-09 11:04:02,083 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 46 remaining) [2024-11-09 11:04:02,083 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 46 remaining) [2024-11-09 11:04:02,083 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 46 remaining) [2024-11-09 11:04:02,083 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 46 remaining) [2024-11-09 11:04:02,083 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 46 remaining) [2024-11-09 11:04:02,083 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 46 remaining) [2024-11-09 11:04:02,083 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 46 remaining) [2024-11-09 11:04:02,083 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 46 remaining) [2024-11-09 11:04:02,083 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 46 remaining) [2024-11-09 11:04:02,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 46 remaining) [2024-11-09 11:04:02,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 46 remaining) [2024-11-09 11:04:02,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 46 remaining) [2024-11-09 11:04:02,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 46 remaining) [2024-11-09 11:04:02,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 46 remaining) [2024-11-09 11:04:02,085 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 46 remaining) [2024-11-09 11:04:02,085 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 46 remaining) [2024-11-09 11:04:02,086 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 46 remaining) [2024-11-09 11:04:02,086 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 46 remaining) [2024-11-09 11:04:02,087 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 46 remaining) [2024-11-09 11:04:02,087 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 46 remaining) [2024-11-09 11:04:02,087 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 46 remaining) [2024-11-09 11:04:02,087 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 46 remaining) [2024-11-09 11:04:02,088 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 46 remaining) [2024-11-09 11:04:02,088 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 46 remaining) [2024-11-09 11:04:02,088 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 46 remaining) [2024-11-09 11:04:02,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-09 11:04:02,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:04:02,292 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:04:02,295 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-09 11:04:02,713 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 11:04:02,741 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 11:04:02 BoogieIcfgContainer [2024-11-09 11:04:02,741 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 11:04:02,742 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 11:04:02,742 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 11:04:02,742 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 11:04:02,742 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:03:52" (3/4) ... [2024-11-09 11:04:02,745 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-09 11:04:02,748 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ReadFromPort [2024-11-09 11:04:02,754 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2024-11-09 11:04:02,755 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-09 11:04:02,756 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-09 11:04:02,756 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 11:04:02,756 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 11:04:02,863 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 11:04:02,864 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 11:04:02,864 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 11:04:02,865 INFO L158 Benchmark]: Toolchain (without parser) took 11266.50ms. Allocated memory was 165.7MB in the beginning and 243.3MB in the end (delta: 77.6MB). Free memory was 135.9MB in the beginning and 76.1MB in the end (delta: 59.8MB). Peak memory consumption was 138.4MB. Max. memory is 16.1GB. [2024-11-09 11:04:02,865 INFO L158 Benchmark]: CDTParser took 1.02ms. Allocated memory is still 109.1MB. Free memory is still 80.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 11:04:02,865 INFO L158 Benchmark]: CACSL2BoogieTranslator took 318.37ms. Allocated memory is still 165.7MB. Free memory was 135.9MB in the beginning and 122.2MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 11:04:02,866 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.85ms. Allocated memory is still 165.7MB. Free memory was 122.2MB in the beginning and 120.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 11:04:02,866 INFO L158 Benchmark]: Boogie Preprocessor took 56.35ms. Allocated memory is still 165.7MB. Free memory was 120.1MB in the beginning and 118.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 11:04:02,866 INFO L158 Benchmark]: RCFGBuilder took 721.07ms. Allocated memory is still 165.7MB. Free memory was 118.0MB in the beginning and 122.0MB in the end (delta: -3.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-09 11:04:02,866 INFO L158 Benchmark]: TraceAbstraction took 9998.03ms. Allocated memory was 165.7MB in the beginning and 243.3MB in the end (delta: 77.6MB). Free memory was 120.9MB in the beginning and 82.4MB in the end (delta: 38.6MB). Peak memory consumption was 119.3MB. Max. memory is 16.1GB. [2024-11-09 11:04:02,867 INFO L158 Benchmark]: Witness Printer took 122.55ms. Allocated memory is still 243.3MB. Free memory was 82.4MB in the beginning and 76.1MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 11:04:02,868 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.02ms. Allocated memory is still 109.1MB. Free memory is still 80.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 318.37ms. Allocated memory is still 165.7MB. Free memory was 135.9MB in the beginning and 122.2MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.85ms. Allocated memory is still 165.7MB. Free memory was 122.2MB in the beginning and 120.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.35ms. Allocated memory is still 165.7MB. Free memory was 120.1MB in the beginning and 118.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 721.07ms. Allocated memory is still 165.7MB. Free memory was 118.0MB in the beginning and 122.0MB in the end (delta: -3.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 9998.03ms. Allocated memory was 165.7MB in the beginning and 243.3MB in the end (delta: 77.6MB). Free memory was 120.9MB in the beginning and 82.4MB in the end (delta: 38.6MB). Peak memory consumption was 119.3MB. Max. memory is 16.1GB. * Witness Printer took 122.55ms. Allocated memory is still 243.3MB. Free memory was 82.4MB in the beginning and 76.1MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 61]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 61]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 61]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 61]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 65]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 65]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 65]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 65]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 71]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 71]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 71]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 71]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 75]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 75]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 75]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 75]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 81]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 81]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 81]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 81]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 85]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 85]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 85]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 85]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 89]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 89]: 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, 130 locations, 46 error locations. Started 1 CEGAR loops. OverallTime: 9.5s, OverallIterations: 13, TraceHistogramMax: 16, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2177 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2141 mSDsluCounter, 2237 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1294 mSDsCounter, 244 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2468 IncrementalHoareTripleChecker+Invalid, 2712 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 244 mSolverCounterUnsat, 943 mSDtfsCounter, 2468 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1214 GetRequests, 1124 SyntacticMatches, 2 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=237occurred in iteration=10, InterpolantAutomatonStates: 81, 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, 13 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 1464 NumberOfCodeBlocks, 1216 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1873 ConstructedInterpolants, 0 QuantifiedInterpolants, 5851 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1054 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 23 InterpolantComputations, 9 PerfectInterpolantSequences, 2482/2729 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 46 specifications checked. All of them hold - InvariantResult [Line: 89]: Loop Invariant Derived loop invariant: ((((((((SIZE >= 0) ? (SIZE % 5) : ((SIZE % 5) + 5)) == 0) && (i == 0)) && (2 <= SIZE)) && (SIZE <= 99999)) && (MAX <= 100000)) || (((((((SIZE >= 0) ? (SIZE % 5) : ((SIZE % 5) + 5)) == 0) && (1 <= i)) && (2 <= SIZE)) && (SIZE <= 99999)) && (MAX <= 100000))) - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: null - ProcedureContractResult [Line: 12]: Procedure Contract for ReadFromPort Derived contract for procedure ReadFromPort. Requires: ((((((SIZE >= 0) ? (SIZE % 5) : ((SIZE % 5) + 5)) == 0) && (2 <= SIZE)) && (SIZE <= 99999)) && (MAX <= 100000)) Ensures: (((((((SIZE >= 0) ? (SIZE % 5) : ((SIZE % 5) + 5)) == 0) && (2 <= SIZE)) && (SIZE <= 99999)) && (MAX <= 100000)) && ((SIZE == \old(SIZE)) && (MAX == \old(MAX)))) RESULT: Ultimate proved your program to be correct! [2024-11-09 11:04:02,910 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE