./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/verifythis/elimination_max_rec.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/verifythis/elimination_max_rec.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 1d89bfe4b4c4586e423a8e3ebdbb120ac074219803de53807cd9f075553c6e3a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 19:44:45,349 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 19:44:45,397 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-10 19:44:45,401 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 19:44:45,401 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 19:44:45,415 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 19:44:45,416 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 19:44:45,416 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 19:44:45,417 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 19:44:45,418 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 19:44:45,418 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 19:44:45,419 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 19:44:45,419 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 19:44:45,419 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 19:44:45,421 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 19:44:45,421 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 19:44:45,421 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 19:44:45,421 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 19:44:45,421 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 19:44:45,422 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 19:44:45,422 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 19:44:45,424 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 19:44:45,427 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 19:44:45,427 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 19:44:45,427 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 19:44:45,427 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-10 19:44:45,427 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 19:44:45,428 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 19:44:45,428 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 19:44:45,428 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 19:44:45,428 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 19:44:45,428 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 19:44:45,428 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 19:44:45,428 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 19:44:45,429 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 19:44:45,429 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 19:44:45,429 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 19:44:45,429 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 19:44:45,429 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 19:44:45,429 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 19:44:45,429 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 19:44:45,430 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 19:44:45,431 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 19:44:45,431 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 19:44:45,431 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 -> 1d89bfe4b4c4586e423a8e3ebdbb120ac074219803de53807cd9f075553c6e3a [2024-11-10 19:44:45,674 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 19:44:45,696 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 19:44:45,699 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 19:44:45,700 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 19:44:45,700 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 19:44:45,702 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/elimination_max_rec.c [2024-11-10 19:44:46,958 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 19:44:47,150 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 19:44:47,151 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/elimination_max_rec.c [2024-11-10 19:44:47,156 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3fb0c838/8dc854b285a84920ad9ff14b2b981da4/FLAG7caec0036 [2024-11-10 19:44:47,525 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3fb0c838/8dc854b285a84920ad9ff14b2b981da4 [2024-11-10 19:44:47,527 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 19:44:47,528 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 19:44:47,529 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 19:44:47,529 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 19:44:47,535 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 19:44:47,535 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:44:47" (1/1) ... [2024-11-10 19:44:47,536 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e5d7c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:44:47, skipping insertion in model container [2024-11-10 19:44:47,536 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:44:47" (1/1) ... [2024-11-10 19:44:47,555 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 19:44:47,717 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 19:44:47,731 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 19:44:47,745 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 19:44:47,758 INFO L204 MainTranslator]: Completed translation [2024-11-10 19:44:47,758 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:44:47 WrapperNode [2024-11-10 19:44:47,758 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 19:44:47,759 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 19:44:47,759 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 19:44:47,759 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 19:44:47,767 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:44:47" (1/1) ... [2024-11-10 19:44:47,777 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:44:47" (1/1) ... [2024-11-10 19:44:47,790 INFO L138 Inliner]: procedures = 19, calls = 21, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 33 [2024-11-10 19:44:47,791 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 19:44:47,791 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 19:44:47,791 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 19:44:47,792 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 19:44:47,800 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:44:47" (1/1) ... [2024-11-10 19:44:47,800 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:44:47" (1/1) ... [2024-11-10 19:44:47,802 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:44:47" (1/1) ... [2024-11-10 19:44:47,813 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-11-10 19:44:47,813 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:44:47" (1/1) ... [2024-11-10 19:44:47,813 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:44:47" (1/1) ... [2024-11-10 19:44:47,817 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:44:47" (1/1) ... [2024-11-10 19:44:47,817 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:44:47" (1/1) ... [2024-11-10 19:44:47,818 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:44:47" (1/1) ... [2024-11-10 19:44:47,819 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:44:47" (1/1) ... [2024-11-10 19:44:47,823 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 19:44:47,823 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 19:44:47,823 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 19:44:47,823 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 19:44:47,824 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:44:47" (1/1) ... [2024-11-10 19:44:47,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 19:44:47,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:44:47,852 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 19:44:47,857 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 19:44:47,889 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 19:44:47,889 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 19:44:47,889 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 19:44:47,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 19:44:47,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 19:44:47,889 INFO L130 BoogieDeclarations]: Found specification of procedure check [2024-11-10 19:44:47,890 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2024-11-10 19:44:47,890 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 19:44:47,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 19:44:47,890 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 19:44:47,890 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 19:44:47,890 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-10 19:44:47,890 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-10 19:44:47,890 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-10 19:44:47,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 19:44:47,952 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 19:44:47,954 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 19:44:48,138 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2024-11-10 19:44:48,138 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 19:44:48,152 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 19:44:48,153 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 19:44:48,155 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:44:48 BoogieIcfgContainer [2024-11-10 19:44:48,156 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 19:44:48,157 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 19:44:48,158 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 19:44:48,162 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 19:44:48,162 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:44:47" (1/3) ... [2024-11-10 19:44:48,163 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46ce7be4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:44:48, skipping insertion in model container [2024-11-10 19:44:48,163 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:44:47" (2/3) ... [2024-11-10 19:44:48,163 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46ce7be4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:44:48, skipping insertion in model container [2024-11-10 19:44:48,164 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:44:48" (3/3) ... [2024-11-10 19:44:48,165 INFO L112 eAbstractionObserver]: Analyzing ICFG elimination_max_rec.c [2024-11-10 19:44:48,179 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 19:44:48,179 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-11-10 19:44:48,220 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 19:44:48,225 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;@387dcccc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 19:44:48,225 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-10 19:44:48,229 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 36 states have internal predecessors, (40), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 19:44:48,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-10 19:44:48,233 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:44:48,234 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:44:48,234 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 19:44:48,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:44:48,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1330752104, now seen corresponding path program 1 times [2024-11-10 19:44:48,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:44:48,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937676629] [2024-11-10 19:44:48,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:44:48,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:44:48,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:48,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 19:44:48,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:48,364 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 19:44:48,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:44:48,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937676629] [2024-11-10 19:44:48,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937676629] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:44:48,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:44:48,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 19:44:48,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882474906] [2024-11-10 19:44:48,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:44:48,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 19:44:48,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:44:48,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 19:44:48,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 19:44:48,399 INFO L87 Difference]: Start difference. First operand has 46 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 36 states have internal predecessors, (40), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 19:44:48,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:44:48,422 INFO L93 Difference]: Finished difference Result 88 states and 105 transitions. [2024-11-10 19:44:48,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 19:44:48,424 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), 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 10 [2024-11-10 19:44:48,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:44:48,430 INFO L225 Difference]: With dead ends: 88 [2024-11-10 19:44:48,431 INFO L226 Difference]: Without dead ends: 34 [2024-11-10 19:44:48,434 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 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 19:44:48,436 INFO L432 NwaCegarLoop]: 49 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, 49 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 19:44:48,437 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 19:44:48,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-10 19:44:48,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-10 19:44:48,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 28 states have internal predecessors, (29), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 19:44:48,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2024-11-10 19:44:48,465 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 10 [2024-11-10 19:44:48,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:44:48,466 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2024-11-10 19:44:48,466 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), 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 19:44:48,466 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2024-11-10 19:44:48,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-10 19:44:48,467 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:44:48,467 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:44:48,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 19:44:48,467 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 19:44:48,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:44:48,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1302122953, now seen corresponding path program 1 times [2024-11-10 19:44:48,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:44:48,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325919705] [2024-11-10 19:44:48,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:44:48,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:44:48,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:48,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 19:44:48,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:48,713 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 19:44:48,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:44:48,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325919705] [2024-11-10 19:44:48,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325919705] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:44:48,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:44:48,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 19:44:48,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822921461] [2024-11-10 19:44:48,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:44:48,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 19:44:48,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:44:48,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 19:44:48,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 19:44:48,719 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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 19:44:48,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:44:48,756 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2024-11-10 19:44:48,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 19:44:48,757 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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 10 [2024-11-10 19:44:48,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:44:48,758 INFO L225 Difference]: With dead ends: 34 [2024-11-10 19:44:48,758 INFO L226 Difference]: Without dead ends: 32 [2024-11-10 19:44:48,758 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 19:44:48,759 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 2 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 19:44:48,760 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 105 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 19:44:48,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-10 19:44:48,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-10 19:44:48,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 26 states have internal predecessors, (27), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 19:44:48,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2024-11-10 19:44:48,773 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 10 [2024-11-10 19:44:48,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:44:48,774 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2024-11-10 19:44:48,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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 19:44:48,774 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2024-11-10 19:44:48,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-10 19:44:48,775 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:44:48,775 INFO L215 NwaCegarLoop]: trace histogram [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 19:44:48,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 19:44:48,776 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting checkErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 19:44:48,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:44:48,776 INFO L85 PathProgramCache]: Analyzing trace with hash 45043647, now seen corresponding path program 1 times [2024-11-10 19:44:48,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:44:48,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047742671] [2024-11-10 19:44:48,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:44:48,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:44:48,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:48,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 19:44:48,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:48,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-10 19:44:48,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:49,000 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 19:44:49,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:44:49,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047742671] [2024-11-10 19:44:49,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047742671] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:44:49,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:44:49,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 19:44:49,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786760018] [2024-11-10 19:44:49,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:44:49,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 19:44:49,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:44:49,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 19:44:49,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-10 19:44:49,004 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 19:44:49,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:44:49,113 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2024-11-10 19:44:49,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 19:44:49,113 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2024-11-10 19:44:49,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:44:49,114 INFO L225 Difference]: With dead ends: 49 [2024-11-10 19:44:49,114 INFO L226 Difference]: Without dead ends: 48 [2024-11-10 19:44:49,115 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-10 19:44:49,115 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 28 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:44:49,116 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 132 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:44:49,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-10 19:44:49,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 41. [2024-11-10 19:44:49,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 33 states have internal predecessors, (36), 6 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 19:44:49,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2024-11-10 19:44:49,122 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 22 [2024-11-10 19:44:49,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:44:49,123 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2024-11-10 19:44:49,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 19:44:49,123 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2024-11-10 19:44:49,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-10 19:44:49,124 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:44:49,124 INFO L215 NwaCegarLoop]: trace histogram [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 19:44:49,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 19:44:49,125 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting checkErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 19:44:49,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:44:49,125 INFO L85 PathProgramCache]: Analyzing trace with hash 45043455, now seen corresponding path program 1 times [2024-11-10 19:44:49,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:44:49,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329894415] [2024-11-10 19:44:49,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:44:49,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:44:49,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:49,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 19:44:49,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:49,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-10 19:44:49,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:49,208 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 19:44:49,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:44:49,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329894415] [2024-11-10 19:44:49,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329894415] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:44:49,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:44:49,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 19:44:49,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219807053] [2024-11-10 19:44:49,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:44:49,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 19:44:49,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:44:49,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 19:44:49,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 19:44:49,215 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 19:44:49,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:44:49,264 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2024-11-10 19:44:49,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 19:44:49,265 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2024-11-10 19:44:49,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:44:49,266 INFO L225 Difference]: With dead ends: 48 [2024-11-10 19:44:49,266 INFO L226 Difference]: Without dead ends: 46 [2024-11-10 19:44:49,266 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 19:44:49,267 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 19 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 19:44:49,267 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 104 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 19:44:49,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-10 19:44:49,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2024-11-10 19:44:49,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 35 states have internal predecessors, (38), 6 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 19:44:49,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2024-11-10 19:44:49,272 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 22 [2024-11-10 19:44:49,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:44:49,273 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2024-11-10 19:44:49,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 19:44:49,273 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2024-11-10 19:44:49,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-10 19:44:49,274 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:44:49,274 INFO L215 NwaCegarLoop]: trace histogram [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 19:44:49,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 19:44:49,274 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting checkErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 19:44:49,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:44:49,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1396353058, now seen corresponding path program 1 times [2024-11-10 19:44:49,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:44:49,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069077633] [2024-11-10 19:44:49,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:44:49,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:44:49,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:49,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 19:44:49,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:49,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-10 19:44:49,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:49,365 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 19:44:49,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:44:49,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069077633] [2024-11-10 19:44:49,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069077633] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:44:49,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:44:49,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 19:44:49,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714454838] [2024-11-10 19:44:49,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:44:49,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 19:44:49,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:44:49,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 19:44:49,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 19:44:49,369 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 19:44:49,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:44:49,427 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2024-11-10 19:44:49,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 19:44:49,427 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2024-11-10 19:44:49,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:44:49,429 INFO L225 Difference]: With dead ends: 43 [2024-11-10 19:44:49,430 INFO L226 Difference]: Without dead ends: 42 [2024-11-10 19:44:49,430 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 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 19:44:49,431 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 21 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 19:44:49,432 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 83 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 19:44:49,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-10 19:44:49,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-11-10 19:44:49,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 34 states have internal predecessors, (36), 6 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 19:44:49,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2024-11-10 19:44:49,437 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 23 [2024-11-10 19:44:49,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:44:49,437 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2024-11-10 19:44:49,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 19:44:49,438 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2024-11-10 19:44:49,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-10 19:44:49,439 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:44:49,439 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 19:44:49,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 19:44:49,439 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting checkErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 19:44:49,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:44:49,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1023239256, now seen corresponding path program 1 times [2024-11-10 19:44:49,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:44:49,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371350859] [2024-11-10 19:44:49,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:44:49,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:44:49,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:49,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 19:44:49,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:49,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-10 19:44:49,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:49,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 19:44:49,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:49,591 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 19:44:49,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:44:49,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371350859] [2024-11-10 19:44:49,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371350859] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 19:44:49,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1320722416] [2024-11-10 19:44:49,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:44:49,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:44:49,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:44:49,596 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 19:44:49,599 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 19:44:49,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:49,665 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 19:44:49,669 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:44:49,785 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 19:44:49,785 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 19:44:49,923 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 19:44:49,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1320722416] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 19:44:49,924 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 19:44:49,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 21 [2024-11-10 19:44:49,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329728388] [2024-11-10 19:44:49,924 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 19:44:49,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-10 19:44:49,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:44:49,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-10 19:44:49,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2024-11-10 19:44:49,926 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand has 22 states, 21 states have (on average 2.2857142857142856) internal successors, (48), 16 states have internal predecessors, (48), 9 states have call successors, (13), 7 states have call predecessors, (13), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-10 19:44:50,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:44:50,221 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2024-11-10 19:44:50,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-10 19:44:50,222 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.2857142857142856) internal successors, (48), 16 states have internal predecessors, (48), 9 states have call successors, (13), 7 states have call predecessors, (13), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 35 [2024-11-10 19:44:50,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:44:50,222 INFO L225 Difference]: With dead ends: 45 [2024-11-10 19:44:50,222 INFO L226 Difference]: Without dead ends: 43 [2024-11-10 19:44:50,223 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=222, Invalid=900, Unknown=0, NotChecked=0, Total=1122 [2024-11-10 19:44:50,224 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 88 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:44:50,224 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 214 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:44:50,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-10 19:44:50,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2024-11-10 19:44:50,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 31 states have (on average 1.096774193548387) internal successors, (34), 32 states have internal predecessors, (34), 6 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 19:44:50,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2024-11-10 19:44:50,232 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 35 [2024-11-10 19:44:50,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:44:50,233 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2024-11-10 19:44:50,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.2857142857142856) internal successors, (48), 16 states have internal predecessors, (48), 9 states have call successors, (13), 7 states have call predecessors, (13), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-10 19:44:50,233 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2024-11-10 19:44:50,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-10 19:44:50,234 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:44:50,234 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:44:50,251 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 19:44:50,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-10 19:44:50,435 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 19:44:50,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:44:50,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1655639907, now seen corresponding path program 1 times [2024-11-10 19:44:50,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:44:50,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425630257] [2024-11-10 19:44:50,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:44:50,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:44:50,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:50,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 19:44:50,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:50,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-10 19:44:50,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:50,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 19:44:50,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:50,537 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 19:44:50,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:44:50,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425630257] [2024-11-10 19:44:50,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425630257] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 19:44:50,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615502691] [2024-11-10 19:44:50,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:44:50,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:44:50,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:44:50,542 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 19:44:50,542 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 19:44:50,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:50,604 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 19:44:50,605 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:44:50,661 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 19:44:50,661 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 19:44:50,754 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 19:44:50,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1615502691] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 19:44:50,755 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 19:44:50,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2024-11-10 19:44:50,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456482551] [2024-11-10 19:44:50,755 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 19:44:50,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-10 19:44:50,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:44:50,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-10 19:44:50,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2024-11-10 19:44:50,756 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand has 17 states, 16 states have (on average 2.8125) internal successors, (45), 12 states have internal predecessors, (45), 6 states have call successors, (11), 6 states have call predecessors, (11), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 19:44:50,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:44:50,935 INFO L93 Difference]: Finished difference Result 82 states and 93 transitions. [2024-11-10 19:44:50,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-10 19:44:50,935 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.8125) internal successors, (45), 12 states have internal predecessors, (45), 6 states have call successors, (11), 6 states have call predecessors, (11), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 36 [2024-11-10 19:44:50,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:44:50,938 INFO L225 Difference]: With dead ends: 82 [2024-11-10 19:44:50,938 INFO L226 Difference]: Without dead ends: 81 [2024-11-10 19:44:50,939 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=170, Invalid=586, Unknown=0, NotChecked=0, Total=756 [2024-11-10 19:44:50,940 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 125 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:44:50,941 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 192 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:44:50,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-10 19:44:50,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 76. [2024-11-10 19:44:50,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 61 states have (on average 1.098360655737705) internal successors, (67), 62 states have internal predecessors, (67), 12 states have call successors, (12), 7 states have call predecessors, (12), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 19:44:50,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2024-11-10 19:44:50,950 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 36 [2024-11-10 19:44:50,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:44:50,950 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2024-11-10 19:44:50,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.8125) internal successors, (45), 12 states have internal predecessors, (45), 6 states have call successors, (11), 6 states have call predecessors, (11), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 19:44:50,950 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2024-11-10 19:44:50,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-10 19:44:50,951 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:44:50,951 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:44:50,968 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 19:44:51,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-10 19:44:51,159 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 19:44:51,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:44:51,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1052983196, now seen corresponding path program 2 times [2024-11-10 19:44:51,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:44:51,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737929609] [2024-11-10 19:44:51,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:44:51,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:44:51,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:51,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 19:44:51,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:51,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-10 19:44:51,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:51,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 19:44:51,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:51,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 19:44:51,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:51,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-10 19:44:51,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:51,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 19:44:51,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:51,492 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-10 19:44:51,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:44:51,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737929609] [2024-11-10 19:44:51,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737929609] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 19:44:51,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [170190031] [2024-11-10 19:44:51,492 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 19:44:51,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:44:51,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:44:51,494 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 19:44:51,495 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 19:44:51,562 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 19:44:51,563 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 19:44:51,564 INFO L255 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-10 19:44:51,566 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:44:51,706 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2024-11-10 19:44:51,706 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 19:44:51,865 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2024-11-10 19:44:51,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [170190031] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 19:44:51,866 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 19:44:51,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 6, 6] total 26 [2024-11-10 19:44:51,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220331064] [2024-11-10 19:44:51,866 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 19:44:51,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-10 19:44:51,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:44:51,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-10 19:44:51,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=596, Unknown=0, NotChecked=0, Total=702 [2024-11-10 19:44:51,868 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand has 27 states, 26 states have (on average 3.076923076923077) internal successors, (80), 20 states have internal predecessors, (80), 12 states have call successors, (21), 8 states have call predecessors, (21), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-10 19:44:52,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:44:52,606 INFO L93 Difference]: Finished difference Result 173 states and 198 transitions. [2024-11-10 19:44:52,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2024-11-10 19:44:52,607 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 3.076923076923077) internal successors, (80), 20 states have internal predecessors, (80), 12 states have call successors, (21), 8 states have call predecessors, (21), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Word has length 75 [2024-11-10 19:44:52,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:44:52,608 INFO L225 Difference]: With dead ends: 173 [2024-11-10 19:44:52,608 INFO L226 Difference]: Without dead ends: 172 [2024-11-10 19:44:52,610 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1178 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=961, Invalid=4151, Unknown=0, NotChecked=0, Total=5112 [2024-11-10 19:44:52,611 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 346 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:44:52,611 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 237 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:44:52,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-11-10 19:44:52,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 138. [2024-11-10 19:44:52,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 110 states have (on average 1.1181818181818182) internal successors, (123), 110 states have internal predecessors, (123), 25 states have call successors, (25), 14 states have call predecessors, (25), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-10 19:44:52,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 161 transitions. [2024-11-10 19:44:52,623 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 161 transitions. Word has length 75 [2024-11-10 19:44:52,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:44:52,624 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 161 transitions. [2024-11-10 19:44:52,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 3.076923076923077) internal successors, (80), 20 states have internal predecessors, (80), 12 states have call successors, (21), 8 states have call predecessors, (21), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-10 19:44:52,624 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 161 transitions. [2024-11-10 19:44:52,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-10 19:44:52,626 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:44:52,626 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:44:52,640 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-10 19:44:52,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:44:52,831 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 19:44:52,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:44:52,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1272053380, now seen corresponding path program 1 times [2024-11-10 19:44:52,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:44:52,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463387855] [2024-11-10 19:44:52,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:44:52,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:44:52,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:53,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 19:44:53,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:53,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-10 19:44:53,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:53,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 19:44:53,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:53,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 19:44:53,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:53,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-10 19:44:53,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:53,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 19:44:53,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:53,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 19:44:53,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:53,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-10 19:44:53,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:53,054 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2024-11-10 19:44:53,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:44:53,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463387855] [2024-11-10 19:44:53,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463387855] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:44:53,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:44:53,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 19:44:53,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977418863] [2024-11-10 19:44:53,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:44:53,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 19:44:53,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:44:53,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 19:44:53,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 19:44:53,056 INFO L87 Difference]: Start difference. First operand 138 states and 161 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 19:44:53,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:44:53,114 INFO L93 Difference]: Finished difference Result 202 states and 234 transitions. [2024-11-10 19:44:53,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 19:44:53,115 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 101 [2024-11-10 19:44:53,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:44:53,115 INFO L225 Difference]: With dead ends: 202 [2024-11-10 19:44:53,115 INFO L226 Difference]: Without dead ends: 126 [2024-11-10 19:44:53,116 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-10 19:44:53,116 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 8 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 19:44:53,116 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 125 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 19:44:53,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-10 19:44:53,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2024-11-10 19:44:53,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 100 states have (on average 1.11) internal successors, (111), 100 states have internal predecessors, (111), 23 states have call successors, (23), 13 states have call predecessors, (23), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-10 19:44:53,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 146 transitions. [2024-11-10 19:44:53,133 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 146 transitions. Word has length 101 [2024-11-10 19:44:53,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:44:53,134 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 146 transitions. [2024-11-10 19:44:53,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 19:44:53,134 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 146 transitions. [2024-11-10 19:44:53,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-10 19:44:53,136 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:44:53,136 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:44:53,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 19:44:53,136 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 19:44:53,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:44:53,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1654967172, now seen corresponding path program 2 times [2024-11-10 19:44:53,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:44:53,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784335454] [2024-11-10 19:44:53,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:44:53,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:44:53,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:53,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 19:44:53,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:53,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-10 19:44:53,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:53,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 19:44:53,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:53,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 19:44:53,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:53,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-10 19:44:53,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:53,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 19:44:53,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:53,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 19:44:53,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:53,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-10 19:44:53,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:53,331 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 69 proven. 4 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2024-11-10 19:44:53,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:44:53,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784335454] [2024-11-10 19:44:53,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784335454] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 19:44:53,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1259076598] [2024-11-10 19:44:53,331 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 19:44:53,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:44:53,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:44:53,333 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 19:44:53,334 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 19:44:53,427 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 19:44:53,428 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 19:44:53,432 INFO L255 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-10 19:44:53,435 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:44:53,602 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 61 proven. 28 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2024-11-10 19:44:53,602 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 19:44:53,811 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 61 proven. 28 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2024-11-10 19:44:53,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1259076598] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 19:44:53,812 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 19:44:53,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 24 [2024-11-10 19:44:53,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540476112] [2024-11-10 19:44:53,812 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 19:44:53,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-10 19:44:53,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:44:53,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-10 19:44:53,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=490, Unknown=0, NotChecked=0, Total=552 [2024-11-10 19:44:53,814 INFO L87 Difference]: Start difference. First operand 126 states and 146 transitions. Second operand has 24 states, 24 states have (on average 3.75) internal successors, (90), 19 states have internal predecessors, (90), 13 states have call successors, (21), 7 states have call predecessors, (21), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-10 19:44:53,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:44:53,980 INFO L93 Difference]: Finished difference Result 130 states and 149 transitions. [2024-11-10 19:44:53,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 19:44:53,981 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.75) internal successors, (90), 19 states have internal predecessors, (90), 13 states have call successors, (21), 7 states have call predecessors, (21), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Word has length 101 [2024-11-10 19:44:53,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:44:53,981 INFO L225 Difference]: With dead ends: 130 [2024-11-10 19:44:53,981 INFO L226 Difference]: Without dead ends: 0 [2024-11-10 19:44:53,982 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=134, Invalid=796, Unknown=0, NotChecked=0, Total=930 [2024-11-10 19:44:53,983 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 22 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:44:53,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 182 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:44:53,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-10 19:44:53,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-10 19:44:53,983 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 19:44:53,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-10 19:44:53,984 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 101 [2024-11-10 19:44:53,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:44:53,984 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-10 19:44:53,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.75) internal successors, (90), 19 states have internal predecessors, (90), 13 states have call successors, (21), 7 states have call predecessors, (21), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-10 19:44:53,984 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-10 19:44:53,984 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-10 19:44:53,986 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2024-11-10 19:44:53,987 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2024-11-10 19:44:53,987 INFO L782 garLoopResultBuilder]: Registering result SAFE for location checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2024-11-10 19:44:53,987 INFO L782 garLoopResultBuilder]: Registering result SAFE for location checkErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2024-11-10 19:44:53,987 INFO L782 garLoopResultBuilder]: Registering result SAFE for location checkErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2024-11-10 19:44:53,987 INFO L782 garLoopResultBuilder]: Registering result SAFE for location checkErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2024-11-10 19:44:54,001 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-10 19:44:54,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:44:54,194 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1] [2024-11-10 19:44:54,196 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-10 19:44:54,836 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 19:44:54,853 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: unknown symbol (const Int (Array Int Int)) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:173) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:173) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:173) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.IcfgBacktranslator.translateExpression(IcfgBacktranslator.java:433) at de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.IcfgBacktranslator.translateExpression(IcfgBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.lib.translation.DefaultTranslator.translateExpressionWithContext(DefaultTranslator.java:166) at de.uni_freiburg.informatik.ultimate.core.lib.translation.DefaultTranslator.translateProcedureContract(DefaultTranslator.java:377) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProcedureContract(ModelTranslationContainer.java:349) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProcedureContract(ModelTranslationContainer.java:338) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.BacktranslationService.translateProcedureContract(BacktranslationService.java:94) at de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.FloydHoareUtils.createProcedureContractResults(FloydHoareUtils.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:199) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-10 19:44:54,857 INFO L158 Benchmark]: Toolchain (without parser) took 7329.42ms. Allocated memory was 174.1MB in the beginning and 299.9MB in the end (delta: 125.8MB). Free memory was 140.0MB in the beginning and 131.7MB in the end (delta: 8.3MB). Peak memory consumption was 135.8MB. Max. memory is 16.1GB. [2024-11-10 19:44:54,857 INFO L158 Benchmark]: CDTParser took 0.74ms. Allocated memory is still 174.1MB. Free memory is still 142.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 19:44:54,858 INFO L158 Benchmark]: CACSL2BoogieTranslator took 229.82ms. Allocated memory is still 174.1MB. Free memory was 139.5MB in the beginning and 127.2MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-10 19:44:54,858 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.71ms. Allocated memory is still 174.1MB. Free memory was 127.2MB in the beginning and 125.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 19:44:54,858 INFO L158 Benchmark]: Boogie Preprocessor took 31.31ms. Allocated memory is still 174.1MB. Free memory was 125.7MB in the beginning and 123.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 19:44:54,858 INFO L158 Benchmark]: IcfgBuilder took 332.45ms. Allocated memory is still 174.1MB. Free memory was 123.6MB in the beginning and 109.6MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-10 19:44:54,858 INFO L158 Benchmark]: TraceAbstraction took 6699.51ms. Allocated memory was 174.1MB in the beginning and 299.9MB in the end (delta: 125.8MB). Free memory was 109.0MB in the beginning and 131.7MB in the end (delta: -22.7MB). Peak memory consumption was 104.3MB. Max. memory is 16.1GB. [2024-11-10 19:44:54,859 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.74ms. Allocated memory is still 174.1MB. Free memory is still 142.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 229.82ms. Allocated memory is still 174.1MB. Free memory was 139.5MB in the beginning and 127.2MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.71ms. Allocated memory is still 174.1MB. Free memory was 127.2MB in the beginning and 125.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.31ms. Allocated memory is still 174.1MB. Free memory was 125.7MB in the beginning and 123.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 332.45ms. Allocated memory is still 174.1MB. Free memory was 123.6MB in the beginning and 109.6MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 6699.51ms. Allocated memory was 174.1MB in the beginning and 299.9MB in the end (delta: 125.8MB). Free memory was 109.0MB in the beginning and 131.7MB in the end (delta: -22.7MB). Peak memory consumption was 104.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: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 26]: 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 4 procedures, 46 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 6.0s, OverallIterations: 10, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 659 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 659 mSDsluCounter, 1423 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1169 mSDsCounter, 68 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 858 IncrementalHoareTripleChecker+Invalid, 926 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 68 mSolverCounterUnsat, 254 mSDtfsCounter, 858 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 718 GetRequests, 531 SyntacticMatches, 0 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1636 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=138occurred in iteration=8, InterpolantAutomatonStates: 130, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 52 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 682 NumberOfCodeBlocks, 682 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 911 ConstructedInterpolants, 0 QuantifiedInterpolants, 2012 SizeOfPredicates, 22 NumberOfNonLiveVariables, 991 ConjunctsInSsa, 51 ConjunctsInUnsatCore, 18 InterpolantComputations, 6 PerfectInterpolantSequences, 1188/1402 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 6 specifications checked. All of them hold - ProcedureContractResult [Line: 7]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (cond != 0) - ExceptionOrErrorResult: IllegalArgumentException: unknown symbol (const Int (Array Int Int)) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: unknown symbol (const Int (Array Int Int)): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:272) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-11-10 19:44:54,883 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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/verifythis/elimination_max_rec.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Bitvector.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 1d89bfe4b4c4586e423a8e3ebdbb120ac074219803de53807cd9f075553c6e3a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 19:44:56,844 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 19:44:56,907 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Bitvector.epf [2024-11-10 19:44:56,911 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 19:44:56,911 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 19:44:56,941 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 19:44:56,942 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 19:44:56,942 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 19:44:56,943 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 19:44:56,943 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 19:44:56,943 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 19:44:56,944 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 19:44:56,944 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 19:44:56,946 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 19:44:56,946 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 19:44:56,946 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 19:44:56,947 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 19:44:56,947 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 19:44:56,947 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 19:44:56,947 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 19:44:56,947 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 19:44:56,949 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 19:44:56,950 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 19:44:56,950 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 19:44:56,950 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 19:44:56,950 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 19:44:56,950 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-10 19:44:56,950 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 19:44:56,951 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 19:44:56,951 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 19:44:56,951 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 19:44:56,951 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 19:44:56,951 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 19:44:56,951 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 19:44:56,952 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 19:44:56,952 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 19:44:56,952 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 19:44:56,952 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 19:44:56,952 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 19:44:56,952 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 19:44:56,953 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 19:44:56,955 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 19:44:56,955 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 19:44:56,955 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 19:44:56,956 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 19:44:56,956 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 19:44:56,956 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 -> 1d89bfe4b4c4586e423a8e3ebdbb120ac074219803de53807cd9f075553c6e3a [2024-11-10 19:44:57,222 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 19:44:57,241 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 19:44:57,245 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 19:44:57,246 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 19:44:57,247 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 19:44:57,248 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/elimination_max_rec.c [2024-11-10 19:44:58,563 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 19:44:58,729 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 19:44:58,730 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/elimination_max_rec.c [2024-11-10 19:44:58,739 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f970fd96/44aae60a1a4e49058e56a7d31fae4d43/FLAGbb803c817 [2024-11-10 19:44:58,755 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f970fd96/44aae60a1a4e49058e56a7d31fae4d43 [2024-11-10 19:44:58,759 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 19:44:58,760 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 19:44:58,763 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 19:44:58,763 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 19:44:58,771 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 19:44:58,771 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:44:58" (1/1) ... [2024-11-10 19:44:58,772 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54ecaad1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:44:58, skipping insertion in model container [2024-11-10 19:44:58,772 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:44:58" (1/1) ... [2024-11-10 19:44:58,789 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 19:44:58,977 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 19:44:58,991 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 19:44:59,010 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 19:44:59,027 INFO L204 MainTranslator]: Completed translation [2024-11-10 19:44:59,028 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:44:59 WrapperNode [2024-11-10 19:44:59,028 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 19:44:59,029 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 19:44:59,029 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 19:44:59,029 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 19:44:59,035 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:44:59" (1/1) ... [2024-11-10 19:44:59,043 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:44:59" (1/1) ... [2024-11-10 19:44:59,058 INFO L138 Inliner]: procedures = 21, calls = 21, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 31 [2024-11-10 19:44:59,059 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 19:44:59,060 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 19:44:59,060 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 19:44:59,060 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 19:44:59,068 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:44:59" (1/1) ... [2024-11-10 19:44:59,069 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:44:59" (1/1) ... [2024-11-10 19:44:59,072 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:44:59" (1/1) ... [2024-11-10 19:44:59,083 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-11-10 19:44:59,083 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:44:59" (1/1) ... [2024-11-10 19:44:59,083 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:44:59" (1/1) ... [2024-11-10 19:44:59,093 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:44:59" (1/1) ... [2024-11-10 19:44:59,093 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:44:59" (1/1) ... [2024-11-10 19:44:59,097 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:44:59" (1/1) ... [2024-11-10 19:44:59,097 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:44:59" (1/1) ... [2024-11-10 19:44:59,103 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 19:44:59,104 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 19:44:59,104 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 19:44:59,104 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 19:44:59,104 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:44:59" (1/1) ... [2024-11-10 19:44:59,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 19:44:59,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:44:59,138 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 19:44:59,142 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 19:44:59,188 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 19:44:59,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 19:44:59,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-10 19:44:59,189 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 19:44:59,189 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 19:44:59,189 INFO L130 BoogieDeclarations]: Found specification of procedure check [2024-11-10 19:44:59,189 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2024-11-10 19:44:59,189 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 19:44:59,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-10 19:44:59,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-10 19:44:59,189 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 19:44:59,189 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 19:44:59,189 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-10 19:44:59,189 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-10 19:44:59,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 19:44:59,264 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 19:44:59,266 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 19:44:59,488 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-10 19:44:59,492 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 19:44:59,505 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 19:44:59,505 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 19:44:59,505 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:44:59 BoogieIcfgContainer [2024-11-10 19:44:59,505 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 19:44:59,508 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 19:44:59,508 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 19:44:59,511 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 19:44:59,511 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:44:58" (1/3) ... [2024-11-10 19:44:59,512 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c4a7c74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:44:59, skipping insertion in model container [2024-11-10 19:44:59,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:44:59" (2/3) ... [2024-11-10 19:44:59,513 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c4a7c74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:44:59, skipping insertion in model container [2024-11-10 19:44:59,514 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:44:59" (3/3) ... [2024-11-10 19:44:59,515 INFO L112 eAbstractionObserver]: Analyzing ICFG elimination_max_rec.c [2024-11-10 19:44:59,528 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 19:44:59,529 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-11-10 19:44:59,583 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 19:44:59,597 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;@4e4468f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 19:44:59,598 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-10 19:44:59,602 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 36 states have internal predecessors, (40), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 19:44:59,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-10 19:44:59,609 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:44:59,610 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:44:59,611 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 19:44:59,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:44:59,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1330752104, now seen corresponding path program 1 times [2024-11-10 19:44:59,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 19:44:59,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [229487629] [2024-11-10 19:44:59,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:44:59,628 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 19:44:59,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 19:44:59,631 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 19:44:59,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 19:44:59,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:44:59,699 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 19:44:59,703 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:44:59,720 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 19:44:59,720 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 19:44:59,721 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 19:44:59,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [229487629] [2024-11-10 19:44:59,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [229487629] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:44:59,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:44:59,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 19:44:59,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683924059] [2024-11-10 19:44:59,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:44:59,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 19:44:59,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 19:44:59,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 19:44:59,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 19:44:59,750 INFO L87 Difference]: Start difference. First operand has 46 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 36 states have internal predecessors, (40), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 19:44:59,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:44:59,777 INFO L93 Difference]: Finished difference Result 85 states and 105 transitions. [2024-11-10 19:44:59,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 19:44:59,779 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), 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 10 [2024-11-10 19:44:59,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:44:59,785 INFO L225 Difference]: With dead ends: 85 [2024-11-10 19:44:59,785 INFO L226 Difference]: Without dead ends: 31 [2024-11-10 19:44:59,788 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 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 19:44:59,794 INFO L432 NwaCegarLoop]: 46 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, 46 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 19:44:59,795 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 19:44:59,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-10 19:44:59,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-11-10 19:44:59,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 25 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 19:44:59,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2024-11-10 19:44:59,827 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 10 [2024-11-10 19:44:59,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:44:59,828 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2024-11-10 19:44:59,828 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), 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 19:44:59,828 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2024-11-10 19:44:59,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-10 19:44:59,828 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:44:59,828 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:44:59,835 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-10 19:45:00,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 19:45:00,035 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 19:45:00,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:45:00,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1302122953, now seen corresponding path program 1 times [2024-11-10 19:45:00,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 19:45:00,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1844728091] [2024-11-10 19:45:00,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:45:00,036 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 19:45:00,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 19:45:00,038 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 19:45:00,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 19:45:00,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:45:00,097 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 19:45:00,098 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:45:00,174 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 19:45:00,174 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 19:45:00,174 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 19:45:00,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1844728091] [2024-11-10 19:45:00,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1844728091] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:45:00,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:45:00,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 19:45:00,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131585068] [2024-11-10 19:45:00,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:45:00,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 19:45:00,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 19:45:00,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 19:45:00,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 19:45:00,177 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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 19:45:00,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:45:00,211 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2024-11-10 19:45:00,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 19:45:00,212 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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 10 [2024-11-10 19:45:00,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:45:00,213 INFO L225 Difference]: With dead ends: 31 [2024-11-10 19:45:00,213 INFO L226 Difference]: Without dead ends: 30 [2024-11-10 19:45:00,213 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 19:45:00,214 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 2 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 19:45:00,214 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 97 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 19:45:00,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-10 19:45:00,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-10 19:45:00,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 24 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 19:45:00,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2024-11-10 19:45:00,219 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 10 [2024-11-10 19:45:00,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:45:00,219 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2024-11-10 19:45:00,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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 19:45:00,219 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2024-11-10 19:45:00,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-10 19:45:00,220 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:45:00,220 INFO L215 NwaCegarLoop]: trace histogram [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 19:45:00,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-10 19:45:00,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 19:45:00,423 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting checkErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 19:45:00,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:45:00,424 INFO L85 PathProgramCache]: Analyzing trace with hash 45043647, now seen corresponding path program 1 times [2024-11-10 19:45:00,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 19:45:00,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1405024644] [2024-11-10 19:45:00,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:45:00,437 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 19:45:00,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 19:45:00,438 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 19:45:00,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-10 19:45:00,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:45:00,488 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 19:45:00,489 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:45:00,547 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 19:45:00,547 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 19:45:00,547 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 19:45:00,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1405024644] [2024-11-10 19:45:00,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1405024644] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:45:00,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:45:00,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 19:45:00,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632327671] [2024-11-10 19:45:00,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:45:00,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 19:45:00,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 19:45:00,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 19:45:00,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 19:45:00,553 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 19:45:00,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:45:00,655 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2024-11-10 19:45:00,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 19:45:00,655 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2024-11-10 19:45:00,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:45:00,657 INFO L225 Difference]: With dead ends: 45 [2024-11-10 19:45:00,657 INFO L226 Difference]: Without dead ends: 44 [2024-11-10 19:45:00,657 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-10 19:45:00,658 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 25 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:45:00,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 121 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:45:00,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-10 19:45:00,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 39. [2024-11-10 19:45:00,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 31 states have internal predecessors, (33), 6 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 19:45:00,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2024-11-10 19:45:00,667 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 22 [2024-11-10 19:45:00,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:45:00,668 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2024-11-10 19:45:00,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 19:45:00,668 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2024-11-10 19:45:00,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-10 19:45:00,669 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:45:00,669 INFO L215 NwaCegarLoop]: trace histogram [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 19:45:00,675 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-10 19:45:00,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 19:45:00,870 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 19:45:00,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:45:00,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1396347100, now seen corresponding path program 1 times [2024-11-10 19:45:00,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 19:45:00,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [841239050] [2024-11-10 19:45:00,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:45:00,871 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 19:45:00,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 19:45:00,873 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 19:45:00,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-10 19:45:00,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:45:00,913 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 19:45:00,914 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:45:00,956 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 19:45:00,957 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 19:45:00,957 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 19:45:00,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [841239050] [2024-11-10 19:45:00,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [841239050] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:45:00,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:45:00,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 19:45:00,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697706990] [2024-11-10 19:45:00,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:45:00,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 19:45:00,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 19:45:00,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 19:45:00,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 19:45:00,958 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 19:45:01,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:45:01,025 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2024-11-10 19:45:01,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 19:45:01,026 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2024-11-10 19:45:01,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:45:01,027 INFO L225 Difference]: With dead ends: 44 [2024-11-10 19:45:01,027 INFO L226 Difference]: Without dead ends: 43 [2024-11-10 19:45:01,027 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 19:45:01,028 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 16 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 19:45:01,028 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 97 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 19:45:01,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-10 19:45:01,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2024-11-10 19:45:01,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 33 states have internal predecessors, (35), 6 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 19:45:01,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2024-11-10 19:45:01,037 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 23 [2024-11-10 19:45:01,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:45:01,037 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2024-11-10 19:45:01,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 19:45:01,037 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2024-11-10 19:45:01,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-10 19:45:01,038 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:45:01,038 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 19:45:01,041 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-10 19:45:01,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 19:45:01,240 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting checkErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 19:45:01,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:45:01,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1023239256, now seen corresponding path program 1 times [2024-11-10 19:45:01,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 19:45:01,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1453253807] [2024-11-10 19:45:01,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:45:01,241 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 19:45:01,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 19:45:01,243 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 19:45:01,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-10 19:45:01,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:45:01,293 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 19:45:01,295 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:45:01,364 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-10 19:45:01,364 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 19:45:01,481 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-10 19:45:01,482 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 19:45:01,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1453253807] [2024-11-10 19:45:01,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1453253807] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-10 19:45:01,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 19:45:01,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2024-11-10 19:45:01,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380964273] [2024-11-10 19:45:01,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:45:01,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 19:45:01,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 19:45:01,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 19:45:01,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-10 19:45:01,484 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 19:45:01,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:45:01,562 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2024-11-10 19:45:01,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 19:45:01,563 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 35 [2024-11-10 19:45:01,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:45:01,574 INFO L225 Difference]: With dead ends: 56 [2024-11-10 19:45:01,574 INFO L226 Difference]: Without dead ends: 55 [2024-11-10 19:45:01,574 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-10 19:45:01,575 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 16 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 19:45:01,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 108 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 19:45:01,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-10 19:45:01,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 40. [2024-11-10 19:45:01,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 31 states have (on average 1.096774193548387) internal successors, (34), 32 states have internal predecessors, (34), 6 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 19:45:01,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2024-11-10 19:45:01,584 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 35 [2024-11-10 19:45:01,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:45:01,584 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2024-11-10 19:45:01,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 19:45:01,585 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2024-11-10 19:45:01,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-10 19:45:01,585 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:45:01,585 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:45:01,590 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-10 19:45:01,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 19:45:01,786 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 19:45:01,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:45:01,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1655639907, now seen corresponding path program 1 times [2024-11-10 19:45:01,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 19:45:01,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [783480350] [2024-11-10 19:45:01,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:45:01,787 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 19:45:01,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 19:45:01,790 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 19:45:01,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-10 19:45:01,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:45:01,844 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 19:45:01,846 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:45:01,918 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 19:45:01,919 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 19:45:02,061 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 19:45:02,062 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 19:45:02,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [783480350] [2024-11-10 19:45:02,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [783480350] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 19:45:02,062 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 19:45:02,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2024-11-10 19:45:02,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495319255] [2024-11-10 19:45:02,062 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 19:45:02,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 19:45:02,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 19:45:02,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 19:45:02,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2024-11-10 19:45:02,063 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 10 states have internal predecessors, (38), 5 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-10 19:45:02,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:45:02,406 INFO L93 Difference]: Finished difference Result 82 states and 94 transitions. [2024-11-10 19:45:02,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-10 19:45:02,406 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 10 states have internal predecessors, (38), 5 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 36 [2024-11-10 19:45:02,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:45:02,407 INFO L225 Difference]: With dead ends: 82 [2024-11-10 19:45:02,407 INFO L226 Difference]: Without dead ends: 0 [2024-11-10 19:45:02,408 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=145, Invalid=505, Unknown=0, NotChecked=0, Total=650 [2024-11-10 19:45:02,408 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 102 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:45:02,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 223 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:45:02,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-10 19:45:02,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-10 19:45:02,409 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 19:45:02,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-10 19:45:02,410 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2024-11-10 19:45:02,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:45:02,410 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-10 19:45:02,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 10 states have internal predecessors, (38), 5 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-10 19:45:02,410 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-10 19:45:02,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-10 19:45:02,413 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2024-11-10 19:45:02,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2024-11-10 19:45:02,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2024-11-10 19:45:02,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location checkErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2024-11-10 19:45:02,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location checkErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2024-11-10 19:45:02,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location checkErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2024-11-10 19:45:02,428 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-10 19:45:02,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 19:45:02,623 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-10 19:45:02,625 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-10 19:45:02,794 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 19:45:02,818 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 07:45:02 BoogieIcfgContainer [2024-11-10 19:45:02,818 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 19:45:02,819 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 19:45:02,819 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 19:45:02,819 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 19:45:02,819 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:44:59" (3/4) ... [2024-11-10 19:45:02,821 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-10 19:45:02,833 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-10 19:45:02,837 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure check [2024-11-10 19:45:02,837 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-11-10 19:45:02,841 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2024-11-10 19:45:02,844 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-11-10 19:45:02,844 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-10 19:45:02,845 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-10 19:45:02,947 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 19:45:02,947 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-10 19:45:02,947 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 19:45:02,948 INFO L158 Benchmark]: Toolchain (without parser) took 4187.98ms. Allocated memory was 58.7MB in the beginning and 86.0MB in the end (delta: 27.3MB). Free memory was 27.7MB in the beginning and 57.9MB in the end (delta: -30.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 19:45:02,948 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 44.0MB. Free memory was 24.7MB in the beginning and 24.7MB in the end (delta: 42.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 19:45:02,948 INFO L158 Benchmark]: CACSL2BoogieTranslator took 265.61ms. Allocated memory is still 58.7MB. Free memory was 27.5MB in the beginning and 28.4MB in the end (delta: -874.1kB). Peak memory consumption was 2.4MB. Max. memory is 16.1GB. [2024-11-10 19:45:02,948 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.54ms. Allocated memory is still 58.7MB. Free memory was 28.4MB in the beginning and 26.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 19:45:02,949 INFO L158 Benchmark]: Boogie Preprocessor took 42.93ms. Allocated memory is still 58.7MB. Free memory was 26.9MB in the beginning and 24.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 19:45:02,949 INFO L158 Benchmark]: IcfgBuilder took 402.36ms. Allocated memory was 58.7MB in the beginning and 71.3MB in the end (delta: 12.6MB). Free memory was 24.6MB in the beginning and 38.4MB in the end (delta: -13.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 19:45:02,949 INFO L158 Benchmark]: TraceAbstraction took 3310.54ms. Allocated memory was 71.3MB in the beginning and 86.0MB in the end (delta: 14.7MB). Free memory was 37.6MB in the beginning and 63.4MB in the end (delta: -25.8MB). Peak memory consumption was 25.1MB. Max. memory is 16.1GB. [2024-11-10 19:45:02,949 INFO L158 Benchmark]: Witness Printer took 128.62ms. Allocated memory is still 86.0MB. Free memory was 62.6MB in the beginning and 57.9MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 19:45:02,950 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 44.0MB. Free memory was 24.7MB in the beginning and 24.7MB in the end (delta: 42.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 265.61ms. Allocated memory is still 58.7MB. Free memory was 27.5MB in the beginning and 28.4MB in the end (delta: -874.1kB). Peak memory consumption was 2.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.54ms. Allocated memory is still 58.7MB. Free memory was 28.4MB in the beginning and 26.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.93ms. Allocated memory is still 58.7MB. Free memory was 26.9MB in the beginning and 24.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 402.36ms. Allocated memory was 58.7MB in the beginning and 71.3MB in the end (delta: 12.6MB). Free memory was 24.6MB in the beginning and 38.4MB in the end (delta: -13.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3310.54ms. Allocated memory was 71.3MB in the beginning and 86.0MB in the end (delta: 14.7MB). Free memory was 37.6MB in the beginning and 63.4MB in the end (delta: -25.8MB). Peak memory consumption was 25.1MB. Max. memory is 16.1GB. * Witness Printer took 128.62ms. Allocated memory is still 86.0MB. Free memory was 62.6MB in the beginning and 57.9MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 26]: 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 4 procedures, 46 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 3.1s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 161 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 161 mSDsluCounter, 692 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 508 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 251 IncrementalHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 184 mSDtfsCounter, 251 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 220 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46occurred in iteration=0, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 22 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 136 NumberOfCodeBlocks, 136 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 199 ConstructedInterpolants, 0 QuantifiedInterpolants, 491 SizeOfPredicates, 9 NumberOfNonLiveVariables, 400 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 24/40 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 6 specifications checked. All of them hold - ProcedureContractResult [Line: 7]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (0 != cond) RESULT: Ultimate proved your program to be correct! [2024-11-10 19:45:02,978 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