./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/array-tiling/pnr4.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 023d838f 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/pnr4.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 c2f943c7ce97bf9be3e11b9d2df150d740ebe8f456342884d8ad0d40610fb008 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 18:30:26,942 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 18:30:27,042 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-10 18:30:27,049 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 18:30:27,049 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 18:30:27,080 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 18:30:27,081 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 18:30:27,081 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 18:30:27,082 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 18:30:27,083 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 18:30:27,084 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 18:30:27,084 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 18:30:27,085 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 18:30:27,085 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 18:30:27,085 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 18:30:27,085 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 18:30:27,086 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 18:30:27,086 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 18:30:27,086 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 18:30:27,086 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 18:30:27,087 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 18:30:27,087 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 18:30:27,087 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 18:30:27,088 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 18:30:27,088 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 18:30:27,088 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-10 18:30:27,088 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 18:30:27,089 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 18:30:27,089 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 18:30:27,089 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 18:30:27,089 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 18:30:27,090 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 18:30:27,090 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 18:30:27,090 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 18:30:27,091 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 18:30:27,091 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 18:30:27,091 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 18:30:27,091 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 18:30:27,092 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 18:30:27,092 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 18:30:27,092 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 18:30:27,093 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 18:30:27,093 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 18:30:27,093 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 18:30:27,093 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 -> c2f943c7ce97bf9be3e11b9d2df150d740ebe8f456342884d8ad0d40610fb008 [2024-11-10 18:30:27,347 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 18:30:27,374 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 18:30:27,378 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 18:30:27,379 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 18:30:27,379 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 18:30:27,381 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-tiling/pnr4.c [2024-11-10 18:30:28,905 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 18:30:29,106 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 18:30:29,107 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/pnr4.c [2024-11-10 18:30:29,115 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34956041c/4d3166a47ce541acb521fe4d684eefc3/FLAG0ffdbbc31 [2024-11-10 18:30:29,490 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34956041c/4d3166a47ce541acb521fe4d684eefc3 [2024-11-10 18:30:29,493 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 18:30:29,494 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 18:30:29,496 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 18:30:29,496 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 18:30:29,500 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 18:30:29,501 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:30:29" (1/1) ... [2024-11-10 18:30:29,502 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@419da1d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:30:29, skipping insertion in model container [2024-11-10 18:30:29,502 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:30:29" (1/1) ... [2024-11-10 18:30:29,528 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 18:30:29,716 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 18:30:29,725 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 18:30:29,750 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 18:30:29,767 INFO L204 MainTranslator]: Completed translation [2024-11-10 18:30:29,768 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:30:29 WrapperNode [2024-11-10 18:30:29,768 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 18:30:29,769 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 18:30:29,769 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 18:30:29,769 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 18:30:29,776 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:30:29" (1/1) ... [2024-11-10 18:30:29,783 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:30:29" (1/1) ... [2024-11-10 18:30:29,808 INFO L138 Inliner]: procedures = 17, calls = 31, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 129 [2024-11-10 18:30:29,809 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 18:30:29,809 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 18:30:29,810 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 18:30:29,810 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 18:30:29,820 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:30:29" (1/1) ... [2024-11-10 18:30:29,820 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:30:29" (1/1) ... [2024-11-10 18:30:29,823 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:30:29" (1/1) ... [2024-11-10 18:30:29,840 INFO L175 MemorySlicer]: Split 18 memory accesses to 3 slices as follows [2, 7, 9]. 50 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7, 0]. The 8 writes are split as follows [0, 0, 8]. [2024-11-10 18:30:29,840 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:30:29" (1/1) ... [2024-11-10 18:30:29,841 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:30:29" (1/1) ... [2024-11-10 18:30:29,846 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:30:29" (1/1) ... [2024-11-10 18:30:29,847 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:30:29" (1/1) ... [2024-11-10 18:30:29,848 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:30:29" (1/1) ... [2024-11-10 18:30:29,850 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:30:29" (1/1) ... [2024-11-10 18:30:29,853 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 18:30:29,854 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 18:30:29,854 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 18:30:29,854 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 18:30:29,855 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:30:29" (1/1) ... [2024-11-10 18:30:29,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 18:30:29,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:30:29,895 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-10 18:30:29,901 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-10 18:30:30,008 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 18:30:30,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 18:30:30,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 18:30:30,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-10 18:30:30,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 18:30:30,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-10 18:30:30,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-10 18:30:30,011 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 18:30:30,011 INFO L130 BoogieDeclarations]: Found specification of procedure ReadFromPort [2024-11-10 18:30:30,012 INFO L138 BoogieDeclarations]: Found implementation of procedure ReadFromPort [2024-11-10 18:30:30,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 18:30:30,012 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 18:30:30,012 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 18:30:30,012 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-10 18:30:30,012 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-10 18:30:30,098 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 18:30:30,101 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 18:30:30,490 INFO L? ?]: Removed 57 outVars from TransFormulas that were not future-live. [2024-11-10 18:30:30,492 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 18:30:30,517 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 18:30:30,518 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 18:30:30,519 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:30:30 BoogieIcfgContainer [2024-11-10 18:30:30,519 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 18:30:30,522 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 18:30:30,523 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 18:30:30,527 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 18:30:30,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:30:29" (1/3) ... [2024-11-10 18:30:30,528 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d7bfb84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:30:30, skipping insertion in model container [2024-11-10 18:30:30,528 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:30:29" (2/3) ... [2024-11-10 18:30:30,529 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d7bfb84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:30:30, skipping insertion in model container [2024-11-10 18:30:30,529 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:30:30" (3/3) ... [2024-11-10 18:30:30,531 INFO L112 eAbstractionObserver]: Analyzing ICFG pnr4.c [2024-11-10 18:30:30,549 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 18:30:30,550 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 38 error locations. [2024-11-10 18:30:30,622 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 18:30:30,630 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;@4e1ab45b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 18:30:30,632 INFO L334 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2024-11-10 18:30:30,636 INFO L276 IsEmpty]: Start isEmpty. Operand has 122 states, 78 states have (on average 1.641025641025641) internal successors, (128), 116 states have internal predecessors, (128), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-10 18:30:30,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-10 18:30:30,642 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:30:30,644 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:30:30,644 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2024-11-10 18:30:30,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:30:30,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1816045251, now seen corresponding path program 1 times [2024-11-10 18:30:30,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:30:30,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385093341] [2024-11-10 18:30:30,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:30:30,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:30:30,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:30,817 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-10 18:30:30,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:30:30,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385093341] [2024-11-10 18:30:30,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385093341] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:30:30,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:30:30,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 18:30:30,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316335677] [2024-11-10 18:30:30,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:30:30,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 18:30:30,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:30:30,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 18:30:30,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 18:30:30,846 INFO L87 Difference]: Start difference. First operand has 122 states, 78 states have (on average 1.641025641025641) internal successors, (128), 116 states have internal predecessors, (128), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-10 18:30:30,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:30:30,872 INFO L93 Difference]: Finished difference Result 238 states and 263 transitions. [2024-11-10 18:30:30,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 18:30:30,875 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-10 18:30:30,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:30:30,882 INFO L225 Difference]: With dead ends: 238 [2024-11-10 18:30:30,882 INFO L226 Difference]: Without dead ends: 115 [2024-11-10 18:30:30,885 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 18:30:30,889 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:30:30,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:30:30,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-10 18:30:30,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-11-10 18:30:30,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 72 states have (on average 1.5972222222222223) internal successors, (115), 109 states have internal predecessors, (115), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-10 18:30:30,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 123 transitions. [2024-11-10 18:30:30,927 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 123 transitions. Word has length 8 [2024-11-10 18:30:30,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:30:30,928 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 123 transitions. [2024-11-10 18:30:30,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-10 18:30:30,928 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 123 transitions. [2024-11-10 18:30:30,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-10 18:30:30,929 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:30:30,929 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:30:30,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 18:30:30,929 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2024-11-10 18:30:30,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:30:30,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1816015460, now seen corresponding path program 1 times [2024-11-10 18:30:30,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:30:30,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036499610] [2024-11-10 18:30:30,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:30:30,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:30:30,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:31,255 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-10 18:30:31,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:30:31,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036499610] [2024-11-10 18:30:31,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036499610] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:30:31,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:30:31,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:30:31,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796993875] [2024-11-10 18:30:31,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:30:31,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:30:31,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:30:31,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:30:31,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:30:31,261 INFO L87 Difference]: Start difference. First operand 115 states and 123 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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-10 18:30:31,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:30:31,319 INFO L93 Difference]: Finished difference Result 115 states and 123 transitions. [2024-11-10 18:30:31,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:30:31,319 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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-10 18:30:31,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:30:31,322 INFO L225 Difference]: With dead ends: 115 [2024-11-10 18:30:31,323 INFO L226 Difference]: Without dead ends: 114 [2024-11-10 18:30:31,324 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-10 18:30:31,325 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 115 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:30:31,325 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 115 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:30:31,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-10 18:30:31,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-11-10 18:30:31,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 72 states have (on average 1.5833333333333333) internal successors, (114), 108 states have internal predecessors, (114), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-10 18:30:31,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 122 transitions. [2024-11-10 18:30:31,341 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 122 transitions. Word has length 8 [2024-11-10 18:30:31,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:30:31,342 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 122 transitions. [2024-11-10 18:30:31,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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-10 18:30:31,342 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 122 transitions. [2024-11-10 18:30:31,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-10 18:30:31,342 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:30:31,342 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:30:31,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 18:30:31,343 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2024-11-10 18:30:31,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:30:31,345 INFO L85 PathProgramCache]: Analyzing trace with hash -461904323, now seen corresponding path program 1 times [2024-11-10 18:30:31,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:30:31,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23717630] [2024-11-10 18:30:31,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:30:31,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:30:31,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:31,648 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-10 18:30:31,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:30:31,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23717630] [2024-11-10 18:30:31,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23717630] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:30:31,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:30:31,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 18:30:31,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525658220] [2024-11-10 18:30:31,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:30:31,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 18:30:31,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:30:31,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 18:30:31,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 18:30:31,653 INFO L87 Difference]: Start difference. First operand 114 states and 122 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:30:31,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:30:31,774 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2024-11-10 18:30:31,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 18:30:31,775 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-10 18:30:31,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:30:31,776 INFO L225 Difference]: With dead ends: 114 [2024-11-10 18:30:31,778 INFO L226 Difference]: Without dead ends: 113 [2024-11-10 18:30:31,778 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-10 18:30:31,779 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 322 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:30:31,780 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 114 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:30:31,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-10 18:30:31,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-11-10 18:30:31,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 72 states have (on average 1.5694444444444444) internal successors, (113), 107 states have internal predecessors, (113), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-10 18:30:31,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 121 transitions. [2024-11-10 18:30:31,795 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 121 transitions. Word has length 9 [2024-11-10 18:30:31,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:30:31,795 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 121 transitions. [2024-11-10 18:30:31,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:30:31,795 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 121 transitions. [2024-11-10 18:30:31,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-10 18:30:31,796 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:30:31,796 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:30:31,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 18:30:31,797 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2024-11-10 18:30:31,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:30:31,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1923498866, now seen corresponding path program 1 times [2024-11-10 18:30:31,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:30:31,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573374752] [2024-11-10 18:30:31,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:30:31,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:30:31,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:31,891 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-10 18:30:31,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:30:31,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573374752] [2024-11-10 18:30:31,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573374752] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:30:31,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:30:31,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:30:31,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471873060] [2024-11-10 18:30:31,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:30:31,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:30:31,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:30:31,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:30:31,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:30:31,895 INFO L87 Difference]: Start difference. First operand 113 states and 121 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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-10 18:30:32,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:30:32,052 INFO L93 Difference]: Finished difference Result 122 states and 130 transitions. [2024-11-10 18:30:32,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:30:32,053 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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 16 [2024-11-10 18:30:32,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:30:32,054 INFO L225 Difference]: With dead ends: 122 [2024-11-10 18:30:32,054 INFO L226 Difference]: Without dead ends: 120 [2024-11-10 18:30:32,055 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-10 18:30:32,056 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 2 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:30:32,056 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 265 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:30:32,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-10 18:30:32,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2024-11-10 18:30:32,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 78 states have (on average 1.5256410256410255) internal successors, (119), 113 states have internal predecessors, (119), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-10 18:30:32,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 127 transitions. [2024-11-10 18:30:32,074 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 127 transitions. Word has length 16 [2024-11-10 18:30:32,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:30:32,074 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 127 transitions. [2024-11-10 18:30:32,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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-10 18:30:32,074 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 127 transitions. [2024-11-10 18:30:32,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-10 18:30:32,075 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:30:32,075 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:30:32,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 18:30:32,075 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2024-11-10 18:30:32,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:30:32,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1557769391, now seen corresponding path program 1 times [2024-11-10 18:30:32,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:30:32,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020421503] [2024-11-10 18:30:32,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:30:32,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:30:32,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:32,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-10 18:30:32,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:32,148 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-10 18:30:32,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:30:32,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020421503] [2024-11-10 18:30:32,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020421503] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:30:32,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:30:32,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 18:30:32,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736704192] [2024-11-10 18:30:32,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:30:32,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:30:32,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:30:32,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:30:32,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:30:32,153 INFO L87 Difference]: Start difference. First operand 119 states and 127 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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-10 18:30:32,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:30:32,348 INFO L93 Difference]: Finished difference Result 208 states and 225 transitions. [2024-11-10 18:30:32,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:30:32,348 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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 17 [2024-11-10 18:30:32,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:30:32,350 INFO L225 Difference]: With dead ends: 208 [2024-11-10 18:30:32,350 INFO L226 Difference]: Without dead ends: 176 [2024-11-10 18:30:32,350 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-10 18:30:32,351 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 50 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 18:30:32,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 116 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 18:30:32,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-11-10 18:30:32,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 173. [2024-11-10 18:30:32,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 128 states have (on average 1.359375) internal successors, (174), 163 states have internal predecessors, (174), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 18:30:32,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 190 transitions. [2024-11-10 18:30:32,372 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 190 transitions. Word has length 17 [2024-11-10 18:30:32,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:30:32,374 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 190 transitions. [2024-11-10 18:30:32,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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-10 18:30:32,376 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 190 transitions. [2024-11-10 18:30:32,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-10 18:30:32,377 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:30:32,377 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:30:32,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 18:30:32,378 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2024-11-10 18:30:32,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:30:32,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1385656129, now seen corresponding path program 1 times [2024-11-10 18:30:32,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:30:32,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247567114] [2024-11-10 18:30:32,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:30:32,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:30:32,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:32,566 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-10 18:30:32,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:30:32,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247567114] [2024-11-10 18:30:32,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247567114] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:30:32,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:30:32,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 18:30:32,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924870006] [2024-11-10 18:30:32,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:30:32,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 18:30:32,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:30:32,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 18:30:32,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-10 18:30:32,574 INFO L87 Difference]: Start difference. First operand 173 states and 190 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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-10 18:30:32,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:30:32,789 INFO L93 Difference]: Finished difference Result 192 states and 209 transitions. [2024-11-10 18:30:32,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 18:30:32,790 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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 23 [2024-11-10 18:30:32,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:30:32,793 INFO L225 Difference]: With dead ends: 192 [2024-11-10 18:30:32,793 INFO L226 Difference]: Without dead ends: 176 [2024-11-10 18:30:32,793 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-10 18:30:32,794 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 330 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 18:30:32,794 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 96 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 18:30:32,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-11-10 18:30:32,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 173. [2024-11-10 18:30:32,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 128 states have (on average 1.3515625) internal successors, (173), 163 states have internal predecessors, (173), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 18:30:32,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 189 transitions. [2024-11-10 18:30:32,804 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 189 transitions. Word has length 23 [2024-11-10 18:30:32,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:30:32,805 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 189 transitions. [2024-11-10 18:30:32,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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-10 18:30:32,805 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 189 transitions. [2024-11-10 18:30:32,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-10 18:30:32,808 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:30:32,808 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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-10 18:30:32,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 18:30:32,808 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2024-11-10 18:30:32,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:30:32,809 INFO L85 PathProgramCache]: Analyzing trace with hash 502453941, now seen corresponding path program 1 times [2024-11-10 18:30:32,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:30:32,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176381912] [2024-11-10 18:30:32,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:30:32,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:30:32,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:32,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-10 18:30:32,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:32,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-10 18:30:32,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:32,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-10 18:30:32,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:32,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 18:30:32,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:32,944 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-10 18:30:32,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:30:32,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176381912] [2024-11-10 18:30:32,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176381912] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:30:32,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:30:32,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:30:32,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277038985] [2024-11-10 18:30:32,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:30:32,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:30:32,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:30:32,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:30:32,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:30:32,974 INFO L87 Difference]: Start difference. First operand 173 states and 189 transitions. Second operand has 4 states, 3 states have (on average 14.0) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-10 18:30:33,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:30:33,152 INFO L93 Difference]: Finished difference Result 181 states and 197 transitions. [2024-11-10 18:30:33,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:30:33,153 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 14.0) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 56 [2024-11-10 18:30:33,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:30:33,154 INFO L225 Difference]: With dead ends: 181 [2024-11-10 18:30:33,154 INFO L226 Difference]: Without dead ends: 179 [2024-11-10 18:30:33,154 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 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-10 18:30:33,155 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 26 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 18:30:33,155 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 185 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 18:30:33,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-11-10 18:30:33,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 178. [2024-11-10 18:30:33,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 133 states have (on average 1.3383458646616542) internal successors, (178), 168 states have internal predecessors, (178), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 18:30:33,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 194 transitions. [2024-11-10 18:30:33,173 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 194 transitions. Word has length 56 [2024-11-10 18:30:33,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:30:33,176 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 194 transitions. [2024-11-10 18:30:33,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 14.0) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-10 18:30:33,176 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 194 transitions. [2024-11-10 18:30:33,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-10 18:30:33,178 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:30:33,178 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 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] [2024-11-10 18:30:33,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 18:30:33,178 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2024-11-10 18:30:33,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:30:33,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1863244729, now seen corresponding path program 1 times [2024-11-10 18:30:33,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:30:33,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578703325] [2024-11-10 18:30:33,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:30:33,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:30:33,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:33,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-10 18:30:33,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:33,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-10 18:30:33,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:33,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-10 18:30:33,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:33,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 18:30:33,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:33,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 18:30:33,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:33,360 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-10 18:30:33,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:30:33,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578703325] [2024-11-10 18:30:33,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578703325] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:30:33,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1739060724] [2024-11-10 18:30:33,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:30:33,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:30:33,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:30:33,363 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-10 18:30:33,364 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-10 18:30:33,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:33,445 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 18:30:33,454 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:30:33,579 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-10 18:30:33,579 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:30:33,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1739060724] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:30:33,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 18:30:33,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-11-10 18:30:33,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616537973] [2024-11-10 18:30:33,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:30:33,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 18:30:33,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:30:33,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 18:30:33,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-10 18:30:33,581 INFO L87 Difference]: Start difference. First operand 178 states and 194 transitions. Second operand has 5 states, 4 states have (on average 12.75) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-10 18:30:33,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:30:33,802 INFO L93 Difference]: Finished difference Result 178 states and 194 transitions. [2024-11-10 18:30:33,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 18:30:33,803 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 12.75) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2024-11-10 18:30:33,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:30:33,804 INFO L225 Difference]: With dead ends: 178 [2024-11-10 18:30:33,804 INFO L226 Difference]: Without dead ends: 161 [2024-11-10 18:30:33,804 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 77 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-10 18:30:33,805 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 74 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 18:30:33,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 180 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 18:30:33,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-11-10 18:30:33,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2024-11-10 18:30:33,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 133 states have (on average 1.2105263157894737) internal successors, (161), 151 states have internal predecessors, (161), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 18:30:33,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 177 transitions. [2024-11-10 18:30:33,816 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 177 transitions. Word has length 69 [2024-11-10 18:30:33,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:30:33,817 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 177 transitions. [2024-11-10 18:30:33,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 12.75) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-10 18:30:33,817 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 177 transitions. [2024-11-10 18:30:33,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-10 18:30:33,818 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:30:33,818 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:30:33,841 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-10 18:30:34,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:30:34,025 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2024-11-10 18:30:34,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:30:34,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1926011821, now seen corresponding path program 1 times [2024-11-10 18:30:34,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:30:34,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727124645] [2024-11-10 18:30:34,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:30:34,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:30:34,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:34,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-10 18:30:34,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:34,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-10 18:30:34,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:34,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-10 18:30:34,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:34,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 18:30:34,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:34,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 18:30:34,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:34,197 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-10 18:30:34,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:30:34,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727124645] [2024-11-10 18:30:34,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727124645] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:30:34,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [929007322] [2024-11-10 18:30:34,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:30:34,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:30:34,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:30:34,204 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-10 18:30:34,205 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-10 18:30:34,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:34,284 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 18:30:34,287 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:30:34,376 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-10 18:30:34,377 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:30:34,505 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-10 18:30:34,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [929007322] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:30:34,505 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 18:30:34,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2024-11-10 18:30:34,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982338190] [2024-11-10 18:30:34,506 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 18:30:34,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 18:30:34,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:30:34,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 18:30:34,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-10 18:30:34,509 INFO L87 Difference]: Start difference. First operand 161 states and 177 transitions. Second operand has 10 states, 9 states have (on average 14.88888888888889) internal successors, (134), 10 states have internal predecessors, (134), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2024-11-10 18:30:34,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:30:34,795 INFO L93 Difference]: Finished difference Result 236 states and 280 transitions. [2024-11-10 18:30:34,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 18:30:34,796 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 14.88888888888889) internal successors, (134), 10 states have internal predecessors, (134), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) Word has length 70 [2024-11-10 18:30:34,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:30:34,798 INFO L225 Difference]: With dead ends: 236 [2024-11-10 18:30:34,798 INFO L226 Difference]: Without dead ends: 219 [2024-11-10 18:30:34,799 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 144 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-10 18:30:34,800 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 179 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 18:30:34,801 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 208 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 18:30:34,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-11-10 18:30:34,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2024-11-10 18:30:34,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 200 states have (on average 1.105) internal successors, (221), 204 states have internal predecessors, (221), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-10 18:30:34,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 247 transitions. [2024-11-10 18:30:34,817 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 247 transitions. Word has length 70 [2024-11-10 18:30:34,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:30:34,817 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 247 transitions. [2024-11-10 18:30:34,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 14.88888888888889) internal successors, (134), 10 states have internal predecessors, (134), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2024-11-10 18:30:34,818 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 247 transitions. [2024-11-10 18:30:34,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-10 18:30:34,819 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:30:34,819 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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] [2024-11-10 18:30:34,842 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 18:30:35,022 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,SelfDestructingSolverStorable8 [2024-11-10 18:30:35,023 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2024-11-10 18:30:35,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:30:35,023 INFO L85 PathProgramCache]: Analyzing trace with hash -641937335, now seen corresponding path program 1 times [2024-11-10 18:30:35,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:30:35,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028797183] [2024-11-10 18:30:35,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:30:35,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:30:35,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:35,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-10 18:30:35,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:35,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-10 18:30:35,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:35,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-10 18:30:35,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:35,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 18:30:35,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:35,176 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-10 18:30:35,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:30:35,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028797183] [2024-11-10 18:30:35,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028797183] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:30:35,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1725041409] [2024-11-10 18:30:35,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:30:35,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:30:35,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:30:35,179 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-10 18:30:35,180 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-10 18:30:35,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:35,266 INFO L255 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 18:30:35,268 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:30:35,308 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-10 18:30:35,309 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:30:35,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1725041409] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:30:35,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 18:30:35,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-11-10 18:30:35,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490542585] [2024-11-10 18:30:35,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:30:35,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 18:30:35,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:30:35,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 18:30:35,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-10 18:30:35,311 INFO L87 Difference]: Start difference. First operand 219 states and 247 transitions. Second operand has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-10 18:30:35,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:30:35,468 INFO L93 Difference]: Finished difference Result 220 states and 248 transitions. [2024-11-10 18:30:35,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 18:30:35,468 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 75 [2024-11-10 18:30:35,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:30:35,471 INFO L225 Difference]: With dead ends: 220 [2024-11-10 18:30:35,471 INFO L226 Difference]: Without dead ends: 219 [2024-11-10 18:30:35,472 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 81 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-10 18:30:35,472 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 114 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:30:35,473 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 160 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:30:35,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-11-10 18:30:35,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 218. [2024-11-10 18:30:35,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 200 states have (on average 1.1) internal successors, (220), 203 states have internal predecessors, (220), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-10 18:30:35,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 246 transitions. [2024-11-10 18:30:35,485 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 246 transitions. Word has length 75 [2024-11-10 18:30:35,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:30:35,485 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 246 transitions. [2024-11-10 18:30:35,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-10 18:30:35,486 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 246 transitions. [2024-11-10 18:30:35,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-10 18:30:35,487 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:30:35,487 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:30:35,505 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-10 18:30:35,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:30:35,688 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2024-11-10 18:30:35,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:30:35,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1574779072, now seen corresponding path program 1 times [2024-11-10 18:30:35,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:30:35,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600649893] [2024-11-10 18:30:35,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:30:35,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:30:35,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:35,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-10 18:30:35,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:35,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-10 18:30:35,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:35,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-10 18:30:35,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:35,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 18:30:35,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:35,852 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-10 18:30:35,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:30:35,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600649893] [2024-11-10 18:30:35,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600649893] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:30:35,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [271074812] [2024-11-10 18:30:35,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:30:35,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:30:35,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:30:35,855 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-10 18:30:35,856 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-10 18:30:35,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:35,939 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 18:30:35,941 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:30:35,976 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-10 18:30:35,977 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:30:36,035 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-10 18:30:36,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [271074812] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:30:36,036 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 18:30:36,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-11-10 18:30:36,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257785084] [2024-11-10 18:30:36,036 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 18:30:36,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 18:30:36,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:30:36,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 18:30:36,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-11-10 18:30:36,038 INFO L87 Difference]: Start difference. First operand 218 states and 246 transitions. Second operand has 12 states, 11 states have (on average 7.363636363636363) internal successors, (81), 12 states have internal predecessors, (81), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-10 18:30:36,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:30:36,314 INFO L93 Difference]: Finished difference Result 240 states and 270 transitions. [2024-11-10 18:30:36,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 18:30:36,314 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.363636363636363) internal successors, (81), 12 states have internal predecessors, (81), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 76 [2024-11-10 18:30:36,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:30:36,316 INFO L225 Difference]: With dead ends: 240 [2024-11-10 18:30:36,316 INFO L226 Difference]: Without dead ends: 239 [2024-11-10 18:30:36,316 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 153 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-10 18:30:36,317 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 159 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 18:30:36,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 304 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 18:30:36,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2024-11-10 18:30:36,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2024-11-10 18:30:36,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 221 states have (on average 1.090497737556561) internal successors, (241), 224 states have internal predecessors, (241), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-10 18:30:36,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 267 transitions. [2024-11-10 18:30:36,327 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 267 transitions. Word has length 76 [2024-11-10 18:30:36,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:30:36,327 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 267 transitions. [2024-11-10 18:30:36,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.363636363636363) internal successors, (81), 12 states have internal predecessors, (81), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-10 18:30:36,327 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 267 transitions. [2024-11-10 18:30:36,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-10 18:30:36,329 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:30:36,329 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 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] [2024-11-10 18:30:36,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-10 18:30:36,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:30:36,534 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2024-11-10 18:30:36,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:30:36,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1442101247, now seen corresponding path program 2 times [2024-11-10 18:30:36,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:30:36,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45139099] [2024-11-10 18:30:36,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:30:36,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:30:36,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:36,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-10 18:30:36,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:36,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-10 18:30:36,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:36,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-10 18:30:36,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:36,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 18:30:36,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:36,787 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-10 18:30:36,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:30:36,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45139099] [2024-11-10 18:30:36,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45139099] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:30:36,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1018253840] [2024-11-10 18:30:36,788 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 18:30:36,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:30:36,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:30:36,790 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-10 18:30:36,792 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-10 18:30:36,862 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-10 18:30:36,862 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 18:30:36,863 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 18:30:36,866 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:30:37,012 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-11-10 18:30:37,013 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:30:37,140 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-11-10 18:30:37,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1018253840] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:30:37,143 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 18:30:37,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 4, 4] total 14 [2024-11-10 18:30:37,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070847770] [2024-11-10 18:30:37,143 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 18:30:37,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-10 18:30:37,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:30:37,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-10 18:30:37,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2024-11-10 18:30:37,148 INFO L87 Difference]: Start difference. First operand 239 states and 267 transitions. Second operand has 15 states, 14 states have (on average 9.785714285714286) internal successors, (137), 15 states have internal predecessors, (137), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-10 18:30:37,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:30:37,525 INFO L93 Difference]: Finished difference Result 249 states and 278 transitions. [2024-11-10 18:30:37,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-10 18:30:37,527 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 9.785714285714286) internal successors, (137), 15 states have internal predecessors, (137), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 97 [2024-11-10 18:30:37,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:30:37,528 INFO L225 Difference]: With dead ends: 249 [2024-11-10 18:30:37,529 INFO L226 Difference]: Without dead ends: 203 [2024-11-10 18:30:37,530 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-10 18:30:37,531 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 275 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 18:30:37,532 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 172 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 18:30:37,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-11-10 18:30:37,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2024-11-10 18:30:37,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 186 states have (on average 1.086021505376344) internal successors, (202), 188 states have internal predecessors, (202), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-10 18:30:37,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 228 transitions. [2024-11-10 18:30:37,541 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 228 transitions. Word has length 97 [2024-11-10 18:30:37,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:30:37,541 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 228 transitions. [2024-11-10 18:30:37,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 9.785714285714286) internal successors, (137), 15 states have internal predecessors, (137), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-10 18:30:37,542 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 228 transitions. [2024-11-10 18:30:37,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-10 18:30:37,543 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:30:37,543 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 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, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:30:37,561 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-10 18:30:37,744 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,SelfDestructingSolverStorable11 [2024-11-10 18:30:37,744 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2024-11-10 18:30:37,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:30:37,745 INFO L85 PathProgramCache]: Analyzing trace with hash 656812281, now seen corresponding path program 1 times [2024-11-10 18:30:37,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:30:37,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087248049] [2024-11-10 18:30:37,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:30:37,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:30:37,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:37,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-10 18:30:37,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:37,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-10 18:30:37,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:37,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-10 18:30:37,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:37,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 18:30:37,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:37,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 18:30:37,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:37,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 18:30:37,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:37,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 18:30:37,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:37,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 18:30:37,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:37,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 18:30:37,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:37,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-10 18:30:37,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:37,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-10 18:30:37,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:37,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-10 18:30:37,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:37,856 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2024-11-10 18:30:37,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:30:37,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087248049] [2024-11-10 18:30:37,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087248049] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:30:37,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:30:37,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:30:37,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445100760] [2024-11-10 18:30:37,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:30:37,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:30:37,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:30:37,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:30:37,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:30:37,858 INFO L87 Difference]: Start difference. First operand 203 states and 228 transitions. Second operand has 4 states, 3 states have (on average 24.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-10 18:30:37,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:30:37,932 INFO L93 Difference]: Finished difference Result 203 states and 228 transitions. [2024-11-10 18:30:37,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:30:37,932 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 24.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 161 [2024-11-10 18:30:37,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:30:37,934 INFO L225 Difference]: With dead ends: 203 [2024-11-10 18:30:37,934 INFO L226 Difference]: Without dead ends: 202 [2024-11-10 18:30:37,934 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 25 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-10 18:30:37,935 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 32 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:30:37,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 81 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:30:37,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-11-10 18:30:37,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2024-11-10 18:30:37,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 186 states have (on average 1.0806451612903225) internal successors, (201), 187 states have internal predecessors, (201), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-10 18:30:37,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 227 transitions. [2024-11-10 18:30:37,943 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 227 transitions. Word has length 161 [2024-11-10 18:30:37,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:30:37,944 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 227 transitions. [2024-11-10 18:30:37,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 24.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-10 18:30:37,944 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 227 transitions. [2024-11-10 18:30:37,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-10 18:30:37,970 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:30:37,970 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 4, 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:30:37,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 18:30:37,971 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2024-11-10 18:30:37,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:30:37,971 INFO L85 PathProgramCache]: Analyzing trace with hash 2070729497, now seen corresponding path program 2 times [2024-11-10 18:30:37,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:30:37,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863656515] [2024-11-10 18:30:37,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:30:37,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:30:38,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:38,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-10 18:30:38,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:38,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-10 18:30:38,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:38,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-10 18:30:38,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:38,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 18:30:38,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:38,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 18:30:38,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:38,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 18:30:38,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:38,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 18:30:38,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:38,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 18:30:38,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:38,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 18:30:38,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:38,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-10 18:30:38,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:38,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-10 18:30:38,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:38,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-10 18:30:38,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:38,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-10 18:30:38,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:38,412 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2024-11-10 18:30:38,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:30:38,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863656515] [2024-11-10 18:30:38,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863656515] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:30:38,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [254585423] [2024-11-10 18:30:38,413 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 18:30:38,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:30:38,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:30:38,415 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-10 18:30:38,417 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-10 18:30:38,506 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-10 18:30:38,506 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 18:30:38,507 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 18:30:38,511 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:30:39,014 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2024-11-10 18:30:39,015 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:30:39,267 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2024-11-10 18:30:39,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [254585423] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:30:39,267 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 18:30:39,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 3] total 9 [2024-11-10 18:30:39,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956036131] [2024-11-10 18:30:39,268 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 18:30:39,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 18:30:39,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:30:39,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 18:30:39,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-10 18:30:39,270 INFO L87 Difference]: Start difference. First operand 202 states and 227 transitions. Second operand has 10 states, 9 states have (on average 15.444444444444445) internal successors, (139), 10 states have internal predecessors, (139), 5 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2024-11-10 18:30:39,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:30:39,446 INFO L93 Difference]: Finished difference Result 202 states and 227 transitions. [2024-11-10 18:30:39,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 18:30:39,446 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 15.444444444444445) internal successors, (139), 10 states have internal predecessors, (139), 5 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) Word has length 174 [2024-11-10 18:30:39,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:30:39,447 INFO L225 Difference]: With dead ends: 202 [2024-11-10 18:30:39,447 INFO L226 Difference]: Without dead ends: 0 [2024-11-10 18:30:39,448 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 369 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2024-11-10 18:30:39,448 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 294 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:30:39,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 37 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:30:39,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-10 18:30:39,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-10 18:30:39,452 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-10 18:30:39,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-10 18:30:39,452 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 174 [2024-11-10 18:30:39,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:30:39,452 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-10 18:30:39,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 15.444444444444445) internal successors, (139), 10 states have internal predecessors, (139), 5 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2024-11-10 18:30:39,452 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-10 18:30:39,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-10 18:30:39,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 38 remaining) [2024-11-10 18:30:39,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 38 remaining) [2024-11-10 18:30:39,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 38 remaining) [2024-11-10 18:30:39,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 38 remaining) [2024-11-10 18:30:39,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 38 remaining) [2024-11-10 18:30:39,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 38 remaining) [2024-11-10 18:30:39,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 38 remaining) [2024-11-10 18:30:39,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 38 remaining) [2024-11-10 18:30:39,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 38 remaining) [2024-11-10 18:30:39,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 38 remaining) [2024-11-10 18:30:39,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 38 remaining) [2024-11-10 18:30:39,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 38 remaining) [2024-11-10 18:30:39,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 38 remaining) [2024-11-10 18:30:39,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 38 remaining) [2024-11-10 18:30:39,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 38 remaining) [2024-11-10 18:30:39,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 38 remaining) [2024-11-10 18:30:39,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 38 remaining) [2024-11-10 18:30:39,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 38 remaining) [2024-11-10 18:30:39,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 38 remaining) [2024-11-10 18:30:39,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 38 remaining) [2024-11-10 18:30:39,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 38 remaining) [2024-11-10 18:30:39,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 38 remaining) [2024-11-10 18:30:39,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 38 remaining) [2024-11-10 18:30:39,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 38 remaining) [2024-11-10 18:30:39,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 38 remaining) [2024-11-10 18:30:39,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 38 remaining) [2024-11-10 18:30:39,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 38 remaining) [2024-11-10 18:30:39,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 38 remaining) [2024-11-10 18:30:39,459 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 38 remaining) [2024-11-10 18:30:39,459 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 38 remaining) [2024-11-10 18:30:39,459 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 38 remaining) [2024-11-10 18:30:39,459 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 38 remaining) [2024-11-10 18:30:39,459 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 38 remaining) [2024-11-10 18:30:39,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 38 remaining) [2024-11-10 18:30:39,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 38 remaining) [2024-11-10 18:30:39,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 38 remaining) [2024-11-10 18:30:39,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 38 remaining) [2024-11-10 18:30:39,463 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 38 remaining) [2024-11-10 18:30:39,481 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-10 18:30:39,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:30:39,667 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:30:39,671 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-10 18:30:40,040 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 18:30:40,069 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 06:30:40 BoogieIcfgContainer [2024-11-10 18:30:40,070 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 18:30:40,070 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 18:30:40,070 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 18:30:40,071 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 18:30:40,071 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:30:30" (3/4) ... [2024-11-10 18:30:40,074 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-10 18:30:40,078 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure ReadFromPort [2024-11-10 18:30:40,084 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2024-11-10 18:30:40,085 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-10 18:30:40,085 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-10 18:30:40,085 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-10 18:30:40,086 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-10 18:30:40,203 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 18:30:40,203 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-10 18:30:40,203 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 18:30:40,204 INFO L158 Benchmark]: Toolchain (without parser) took 10709.72ms. Allocated memory was 182.5MB in the beginning and 268.4MB in the end (delta: 86.0MB). Free memory was 114.6MB in the beginning and 190.1MB in the end (delta: -75.5MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. [2024-11-10 18:30:40,204 INFO L158 Benchmark]: CDTParser took 1.64ms. Allocated memory is still 104.9MB. Free memory is still 68.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 18:30:40,204 INFO L158 Benchmark]: CACSL2BoogieTranslator took 272.84ms. Allocated memory is still 182.5MB. Free memory was 114.4MB in the beginning and 101.2MB in the end (delta: 13.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-10 18:30:40,205 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.84ms. Allocated memory is still 182.5MB. Free memory was 101.2MB in the beginning and 99.3MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 18:30:40,205 INFO L158 Benchmark]: Boogie Preprocessor took 43.87ms. Allocated memory is still 182.5MB. Free memory was 99.3MB in the beginning and 97.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 18:30:40,205 INFO L158 Benchmark]: IcfgBuilder took 665.09ms. Allocated memory is still 182.5MB. Free memory was 97.2MB in the beginning and 137.9MB in the end (delta: -40.7MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. [2024-11-10 18:30:40,205 INFO L158 Benchmark]: TraceAbstraction took 9547.41ms. Allocated memory was 182.5MB in the beginning and 268.4MB in the end (delta: 86.0MB). Free memory was 137.2MB in the beginning and 196.4MB in the end (delta: -59.2MB). Peak memory consumption was 28.5MB. Max. memory is 16.1GB. [2024-11-10 18:30:40,205 INFO L158 Benchmark]: Witness Printer took 133.11ms. Allocated memory is still 268.4MB. Free memory was 196.4MB in the beginning and 190.1MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-10 18:30:40,210 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.64ms. Allocated memory is still 104.9MB. Free memory is still 68.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 272.84ms. Allocated memory is still 182.5MB. Free memory was 114.4MB in the beginning and 101.2MB in the end (delta: 13.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.84ms. Allocated memory is still 182.5MB. Free memory was 101.2MB in the beginning and 99.3MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 43.87ms. Allocated memory is still 182.5MB. Free memory was 99.3MB in the beginning and 97.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 665.09ms. Allocated memory is still 182.5MB. Free memory was 97.2MB in the beginning and 137.9MB in the end (delta: -40.7MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. * TraceAbstraction took 9547.41ms. Allocated memory was 182.5MB in the beginning and 268.4MB in the end (delta: 86.0MB). Free memory was 137.2MB in the beginning and 196.4MB in the end (delta: -59.2MB). Peak memory consumption was 28.5MB. Max. memory is 16.1GB. * Witness Printer took 133.11ms. Allocated memory is still 268.4MB. Free memory was 196.4MB in the beginning and 190.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: 79]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 79]: 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: 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: 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: 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: 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: 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 122 locations, 38 error locations. Started 1 CEGAR loops. OverallTime: 9.1s, OverallIterations: 14, TraceHistogramMax: 13, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2000 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1972 mSDsluCounter, 2164 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1184 mSDsCounter, 199 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2355 IncrementalHoareTripleChecker+Invalid, 2554 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 199 mSolverCounterUnsat, 980 mSDtfsCounter, 2355 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1155 GetRequests, 1066 SyntacticMatches, 4 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=239occurred in iteration=11, InterpolantAutomatonStates: 82, 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, 14 MinimizatonAttempts, 9 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 1420 NumberOfCodeBlocks, 1184 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1813 ConstructedInterpolants, 0 QuantifiedInterpolants, 5491 SizeOfPredicates, 4 NumberOfNonLiveVariables, 968 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 24 InterpolantComputations, 10 PerfectInterpolantSequences, 1840/2077 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 38 specifications checked. All of them hold - InvariantResult [Line: 79]: Location Invariant Derived location invariant: null - InvariantResult [Line: 36]: Location Invariant Derived location invariant: null - ProcedureContractResult [Line: 12]: Procedure Contract for ReadFromPort Derived contract for procedure ReadFromPort. Requires: ((((((SIZE >= 0) ? (SIZE % 4) : ((SIZE % 4) + 4)) == 0) && (2 <= SIZE)) && (SIZE <= 99999)) && (MAX <= 100000)) Ensures: (((((((SIZE >= 0) ? (SIZE % 4) : ((SIZE % 4) + 4)) == 0) && (2 <= SIZE)) && (SIZE <= 99999)) && (MAX <= 100000)) && ((SIZE == \old(SIZE)) && (MAX == \old(MAX)))) RESULT: Ultimate proved your program to be correct! [2024-11-10 18:30:40,244 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