./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/McCarthy91-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/McCarthy91-2.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 2a5dd5c1c64cd1875ba800cc2db6d1da955f2d2f519c1964ff87558bc42b9b4c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 20:39:58,984 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 20:39:59,059 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-24 20:39:59,065 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 20:39:59,065 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 20:39:59,099 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 20:39:59,101 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 20:39:59,101 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 20:39:59,102 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 20:39:59,104 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 20:39:59,104 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 20:39:59,104 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 20:39:59,105 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 20:39:59,106 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 20:39:59,107 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 20:39:59,107 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 20:39:59,107 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 20:39:59,108 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 20:39:59,108 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 20:39:59,108 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 20:39:59,112 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 20:39:59,112 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 20:39:59,112 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 20:39:59,113 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 20:39:59,113 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 20:39:59,113 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-24 20:39:59,113 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 20:39:59,114 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 20:39:59,114 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 20:39:59,114 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 20:39:59,114 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 20:39:59,115 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 20:39:59,115 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 20:39:59,115 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 20:39:59,115 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 20:39:59,116 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 20:39:59,116 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 20:39:59,116 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 20:39:59,116 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 20:39:59,117 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 20:39:59,117 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 20:39:59,118 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 20:39:59,118 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 20:39:59,119 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 20:39:59,119 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 -> 2a5dd5c1c64cd1875ba800cc2db6d1da955f2d2f519c1964ff87558bc42b9b4c [2024-10-24 20:39:59,358 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 20:39:59,384 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 20:39:59,386 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 20:39:59,387 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 20:39:59,388 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 20:39:59,389 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/McCarthy91-2.c [2024-10-24 20:40:00,851 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 20:40:01,033 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 20:40:01,034 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/McCarthy91-2.c [2024-10-24 20:40:01,040 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88ccdb538/48b5a2af54b24296bb652abbd3dae1d3/FLAG0977918b4 [2024-10-24 20:40:01,437 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88ccdb538/48b5a2af54b24296bb652abbd3dae1d3 [2024-10-24 20:40:01,439 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 20:40:01,440 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 20:40:01,442 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 20:40:01,442 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 20:40:01,449 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 20:40:01,449 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:40:01" (1/1) ... [2024-10-24 20:40:01,450 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ee0d7d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:40:01, skipping insertion in model container [2024-10-24 20:40:01,451 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:40:01" (1/1) ... [2024-10-24 20:40:01,469 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 20:40:01,701 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 20:40:01,712 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 20:40:01,729 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 20:40:01,749 INFO L204 MainTranslator]: Completed translation [2024-10-24 20:40:01,750 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:40:01 WrapperNode [2024-10-24 20:40:01,750 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 20:40:01,751 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 20:40:01,751 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 20:40:01,751 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 20:40:01,759 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:40:01" (1/1) ... [2024-10-24 20:40:01,765 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:40:01" (1/1) ... [2024-10-24 20:40:01,780 INFO L138 Inliner]: procedures = 13, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 36 [2024-10-24 20:40:01,780 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 20:40:01,781 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 20:40:01,781 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 20:40:01,781 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 20:40:01,792 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:40:01" (1/1) ... [2024-10-24 20:40:01,793 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:40:01" (1/1) ... [2024-10-24 20:40:01,798 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:40:01" (1/1) ... [2024-10-24 20:40:01,809 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 20:40:01,810 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:40:01" (1/1) ... [2024-10-24 20:40:01,810 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:40:01" (1/1) ... [2024-10-24 20:40:01,812 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:40:01" (1/1) ... [2024-10-24 20:40:01,815 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:40:01" (1/1) ... [2024-10-24 20:40:01,816 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:40:01" (1/1) ... [2024-10-24 20:40:01,817 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:40:01" (1/1) ... [2024-10-24 20:40:01,818 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 20:40:01,819 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 20:40:01,819 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 20:40:01,820 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 20:40:01,821 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:40:01" (1/1) ... [2024-10-24 20:40:01,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 20:40:01,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 20:40:01,858 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 20:40:01,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 20:40:01,914 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 20:40:01,914 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 20:40:01,915 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 20:40:01,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 20:40:01,915 INFO L130 BoogieDeclarations]: Found specification of procedure f91 [2024-10-24 20:40:01,915 INFO L138 BoogieDeclarations]: Found implementation of procedure f91 [2024-10-24 20:40:01,981 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 20:40:01,985 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 20:40:02,169 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-24 20:40:02,172 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 20:40:02,204 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 20:40:02,205 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-24 20:40:02,205 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:40:02 BoogieIcfgContainer [2024-10-24 20:40:02,205 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 20:40:02,208 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 20:40:02,209 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 20:40:02,212 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 20:40:02,212 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 08:40:01" (1/3) ... [2024-10-24 20:40:02,213 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7731c948 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:40:02, skipping insertion in model container [2024-10-24 20:40:02,214 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:40:01" (2/3) ... [2024-10-24 20:40:02,214 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7731c948 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:40:02, skipping insertion in model container [2024-10-24 20:40:02,215 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:40:02" (3/3) ... [2024-10-24 20:40:02,216 INFO L112 eAbstractionObserver]: Analyzing ICFG McCarthy91-2.c [2024-10-24 20:40:02,233 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 20:40:02,233 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-10-24 20:40:02,299 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 20:40:02,307 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;@659ee1be, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 20:40:02,308 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-10-24 20:40:02,312 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 24 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 20:40:02,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-24 20:40:02,319 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:40:02,320 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-24 20:40:02,321 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting f91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-24 20:40:02,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:40:02,327 INFO L85 PathProgramCache]: Analyzing trace with hash 85623402, now seen corresponding path program 1 times [2024-10-24 20:40:02,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:40:02,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456794213] [2024-10-24 20:40:02,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:40:02,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:40:02,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:40:02,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 20:40:02,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:40:02,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456794213] [2024-10-24 20:40:02,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456794213] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:40:02,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 20:40:02,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 20:40:02,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440104304] [2024-10-24 20:40:02,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:40:02,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 20:40:02,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:40:02,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 20:40:02,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 20:40:02,547 INFO L87 Difference]: Start difference. First operand has 29 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 24 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 20:40:02,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:40:02,587 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2024-10-24 20:40:02,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 20:40:02,589 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-24 20:40:02,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:40:02,594 INFO L225 Difference]: With dead ends: 31 [2024-10-24 20:40:02,595 INFO L226 Difference]: Without dead ends: 24 [2024-10-24 20:40:02,597 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 20:40:02,600 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 1 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 20:40:02,601 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 47 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 20:40:02,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-10-24 20:40:02,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-10-24 20:40:02,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 19 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 20:40:02,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2024-10-24 20:40:02,636 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 5 [2024-10-24 20:40:02,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:40:02,636 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2024-10-24 20:40:02,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 20:40:02,637 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2024-10-24 20:40:02,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-24 20:40:02,637 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:40:02,637 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-24 20:40:02,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 20:40:02,640 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting f91Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-24 20:40:02,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:40:02,641 INFO L85 PathProgramCache]: Analyzing trace with hash 85623562, now seen corresponding path program 1 times [2024-10-24 20:40:02,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:40:02,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576784317] [2024-10-24 20:40:02,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:40:02,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:40:02,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:40:02,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 20:40:02,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:40:02,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576784317] [2024-10-24 20:40:02,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576784317] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:40:02,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 20:40:02,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 20:40:02,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923207358] [2024-10-24 20:40:02,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:40:02,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 20:40:02,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:40:02,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 20:40:02,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 20:40:02,764 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 5 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 20:40:02,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:40:02,970 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2024-10-24 20:40:02,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 20:40:02,971 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-24 20:40:02,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:40:02,973 INFO L225 Difference]: With dead ends: 41 [2024-10-24 20:40:02,973 INFO L226 Difference]: Without dead ends: 40 [2024-10-24 20:40:02,974 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 20:40:02,975 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 24 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 20:40:02,976 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 39 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 20:40:02,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-10-24 20:40:02,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2024-10-24 20:40:02,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 28 states have internal predecessors, (32), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-24 20:40:02,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2024-10-24 20:40:02,993 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 5 [2024-10-24 20:40:02,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:40:02,993 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2024-10-24 20:40:02,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 20:40:02,994 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2024-10-24 20:40:02,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-24 20:40:02,995 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:40:02,995 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-24 20:40:02,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 20:40:02,995 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting f91Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-24 20:40:02,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:40:02,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1640641763, now seen corresponding path program 1 times [2024-10-24 20:40:02,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:40:02,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786201213] [2024-10-24 20:40:02,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:40:02,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:40:03,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:40:03,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 20:40:03,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:40:03,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786201213] [2024-10-24 20:40:03,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786201213] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:40:03,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 20:40:03,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 20:40:03,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605947158] [2024-10-24 20:40:03,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:40:03,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 20:40:03,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:40:03,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 20:40:03,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 20:40:03,058 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 20:40:03,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:40:03,167 INFO L93 Difference]: Finished difference Result 56 states and 68 transitions. [2024-10-24 20:40:03,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 20:40:03,168 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-24 20:40:03,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:40:03,169 INFO L225 Difference]: With dead ends: 56 [2024-10-24 20:40:03,170 INFO L226 Difference]: Without dead ends: 53 [2024-10-24 20:40:03,171 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 20:40:03,173 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 26 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 20:40:03,175 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 45 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 20:40:03,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-10-24 20:40:03,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 46. [2024-10-24 20:40:03,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 32 states have (on average 1.28125) internal successors, (41), 35 states have internal predecessors, (41), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-24 20:40:03,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 55 transitions. [2024-10-24 20:40:03,191 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 55 transitions. Word has length 6 [2024-10-24 20:40:03,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:40:03,191 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 55 transitions. [2024-10-24 20:40:03,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 20:40:03,192 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2024-10-24 20:40:03,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-24 20:40:03,192 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:40:03,192 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-24 20:40:03,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 20:40:03,193 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting f91Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-24 20:40:03,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:40:03,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1640636798, now seen corresponding path program 1 times [2024-10-24 20:40:03,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:40:03,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915415165] [2024-10-24 20:40:03,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:40:03,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:40:03,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:40:03,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 20:40:03,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:40:03,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915415165] [2024-10-24 20:40:03,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915415165] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:40:03,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 20:40:03,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 20:40:03,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087313148] [2024-10-24 20:40:03,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:40:03,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 20:40:03,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:40:03,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 20:40:03,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 20:40:03,220 INFO L87 Difference]: Start difference. First operand 46 states and 55 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 20:40:03,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:40:03,240 INFO L93 Difference]: Finished difference Result 52 states and 65 transitions. [2024-10-24 20:40:03,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 20:40:03,241 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-24 20:40:03,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:40:03,242 INFO L225 Difference]: With dead ends: 52 [2024-10-24 20:40:03,242 INFO L226 Difference]: Without dead ends: 51 [2024-10-24 20:40:03,242 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 20:40:03,243 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 4 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 20:40:03,244 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 33 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 20:40:03,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-10-24 20:40:03,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2024-10-24 20:40:03,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 32 states have (on average 1.1875) internal successors, (38), 34 states have internal predecessors, (38), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-24 20:40:03,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2024-10-24 20:40:03,254 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 6 [2024-10-24 20:40:03,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:40:03,254 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2024-10-24 20:40:03,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 20:40:03,255 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2024-10-24 20:40:03,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-24 20:40:03,255 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:40:03,255 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 20:40:03,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 20:40:03,256 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting f91Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-24 20:40:03,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:40:03,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1319586569, now seen corresponding path program 1 times [2024-10-24 20:40:03,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:40:03,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789562525] [2024-10-24 20:40:03,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:40:03,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:40:03,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:40:03,333 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 20:40:03,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:40:03,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789562525] [2024-10-24 20:40:03,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789562525] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:40:03,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 20:40:03,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 20:40:03,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67548251] [2024-10-24 20:40:03,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:40:03,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 20:40:03,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:40:03,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 20:40:03,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 20:40:03,336 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 20:40:03,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:40:03,407 INFO L93 Difference]: Finished difference Result 67 states and 81 transitions. [2024-10-24 20:40:03,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 20:40:03,408 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-10-24 20:40:03,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:40:03,409 INFO L225 Difference]: With dead ends: 67 [2024-10-24 20:40:03,409 INFO L226 Difference]: Without dead ends: 66 [2024-10-24 20:40:03,409 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-24 20:40:03,410 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 14 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 20:40:03,411 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 68 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 20:40:03,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-24 20:40:03,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 57. [2024-10-24 20:40:03,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 41 states have (on average 1.170731707317073) internal successors, (48), 43 states have internal predecessors, (48), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-24 20:40:03,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 66 transitions. [2024-10-24 20:40:03,422 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 66 transitions. Word has length 11 [2024-10-24 20:40:03,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:40:03,422 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 66 transitions. [2024-10-24 20:40:03,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 20:40:03,422 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2024-10-24 20:40:03,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-24 20:40:03,423 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:40:03,423 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 20:40:03,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 20:40:03,425 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-24 20:40:03,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:40:03,426 INFO L85 PathProgramCache]: Analyzing trace with hash -2141161786, now seen corresponding path program 1 times [2024-10-24 20:40:03,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:40:03,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522383428] [2024-10-24 20:40:03,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:40:03,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:40:03,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:40:03,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 20:40:03,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:40:03,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 20:40:03,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:40:03,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522383428] [2024-10-24 20:40:03,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522383428] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:40:03,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 20:40:03,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 20:40:03,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978794150] [2024-10-24 20:40:03,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:40:03,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 20:40:03,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:40:03,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 20:40:03,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 20:40:03,486 INFO L87 Difference]: Start difference. First operand 57 states and 66 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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-10-24 20:40:03,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:40:03,507 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2024-10-24 20:40:03,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 20:40:03,507 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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 12 [2024-10-24 20:40:03,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:40:03,508 INFO L225 Difference]: With dead ends: 57 [2024-10-24 20:40:03,508 INFO L226 Difference]: Without dead ends: 47 [2024-10-24 20:40:03,508 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 20:40:03,509 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 20:40:03,510 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 20:40:03,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-10-24 20:40:03,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-10-24 20:40:03,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 35 states have internal predecessors, (39), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-24 20:40:03,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2024-10-24 20:40:03,521 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 12 [2024-10-24 20:40:03,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:40:03,522 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2024-10-24 20:40:03,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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-10-24 20:40:03,522 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2024-10-24 20:40:03,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-24 20:40:03,523 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:40:03,523 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 20:40:03,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 20:40:03,523 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting f91Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-24 20:40:03,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:40:03,525 INFO L85 PathProgramCache]: Analyzing trace with hash 2077163007, now seen corresponding path program 1 times [2024-10-24 20:40:03,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:40:03,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437238404] [2024-10-24 20:40:03,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:40:03,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:40:03,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:40:03,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 20:40:03,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:40:03,631 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 20:40:03,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:40:03,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437238404] [2024-10-24 20:40:03,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437238404] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:40:03,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 20:40:03,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 20:40:03,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057298638] [2024-10-24 20:40:03,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:40:03,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 20:40:03,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:40:03,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 20:40:03,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 20:40:03,635 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 20:40:03,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:40:03,776 INFO L93 Difference]: Finished difference Result 100 states and 129 transitions. [2024-10-24 20:40:03,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 20:40:03,778 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-10-24 20:40:03,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:40:03,782 INFO L225 Difference]: With dead ends: 100 [2024-10-24 20:40:03,782 INFO L226 Difference]: Without dead ends: 99 [2024-10-24 20:40:03,782 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-10-24 20:40:03,783 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 21 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 20:40:03,785 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 58 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 20:40:03,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-24 20:40:03,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 89. [2024-10-24 20:40:03,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 60 states have (on average 1.15) internal successors, (69), 65 states have internal predecessors, (69), 19 states have call successors, (19), 6 states have call predecessors, (19), 8 states have return successors, (22), 17 states have call predecessors, (22), 16 states have call successors, (22) [2024-10-24 20:40:03,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 110 transitions. [2024-10-24 20:40:03,819 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 110 transitions. Word has length 18 [2024-10-24 20:40:03,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:40:03,819 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 110 transitions. [2024-10-24 20:40:03,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 20:40:03,819 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 110 transitions. [2024-10-24 20:40:03,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-24 20:40:03,820 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:40:03,824 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 20:40:03,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 20:40:03,825 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting f91Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-24 20:40:03,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:40:03,825 INFO L85 PathProgramCache]: Analyzing trace with hash -32461112, now seen corresponding path program 1 times [2024-10-24 20:40:03,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:40:03,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863523360] [2024-10-24 20:40:03,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:40:03,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:40:03,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:40:03,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 20:40:03,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:40:04,003 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 20:40:04,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:40:04,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863523360] [2024-10-24 20:40:04,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863523360] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 20:40:04,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [971389495] [2024-10-24 20:40:04,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:40:04,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:40:04,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 20:40:04,012 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 20:40:04,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 20:40:04,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:40:04,061 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-24 20:40:04,065 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 20:40:04,225 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 20:40:04,226 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 20:40:04,477 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 20:40:04,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [971389495] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 20:40:04,478 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 20:40:04,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 22 [2024-10-24 20:40:04,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835486999] [2024-10-24 20:40:04,478 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 20:40:04,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-24 20:40:04,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:40:04,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-24 20:40:04,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=424, Unknown=0, NotChecked=0, Total=506 [2024-10-24 20:40:04,480 INFO L87 Difference]: Start difference. First operand 89 states and 110 transitions. Second operand has 23 states, 20 states have (on average 2.2) internal successors, (44), 18 states have internal predecessors, (44), 9 states have call successors, (9), 6 states have call predecessors, (9), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 20:40:04,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:40:04,792 INFO L93 Difference]: Finished difference Result 98 states and 127 transitions. [2024-10-24 20:40:04,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-24 20:40:04,793 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 2.2) internal successors, (44), 18 states have internal predecessors, (44), 9 states have call successors, (9), 6 states have call predecessors, (9), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 19 [2024-10-24 20:40:04,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:40:04,794 INFO L225 Difference]: With dead ends: 98 [2024-10-24 20:40:04,794 INFO L226 Difference]: Without dead ends: 97 [2024-10-24 20:40:04,795 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=260, Invalid=862, Unknown=0, NotChecked=0, Total=1122 [2024-10-24 20:40:04,796 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 62 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 20:40:04,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 26 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 20:40:04,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-10-24 20:40:04,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 88. [2024-10-24 20:40:04,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 60 states have (on average 1.1166666666666667) internal successors, (67), 64 states have internal predecessors, (67), 19 states have call successors, (19), 6 states have call predecessors, (19), 8 states have return successors, (22), 17 states have call predecessors, (22), 16 states have call successors, (22) [2024-10-24 20:40:04,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 108 transitions. [2024-10-24 20:40:04,819 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 108 transitions. Word has length 19 [2024-10-24 20:40:04,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:40:04,819 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 108 transitions. [2024-10-24 20:40:04,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 2.2) internal successors, (44), 18 states have internal predecessors, (44), 9 states have call successors, (9), 6 states have call predecessors, (9), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 20:40:04,823 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 108 transitions. [2024-10-24 20:40:04,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-24 20:40:04,824 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:40:04,825 INFO L215 NwaCegarLoop]: trace histogram [5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-10-24 20:40:04,847 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 20:40:05,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:40:05,026 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting f91Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-24 20:40:05,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:40:05,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1885988442, now seen corresponding path program 1 times [2024-10-24 20:40:05,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:40:05,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599107382] [2024-10-24 20:40:05,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:40:05,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:40:05,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:40:05,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 20:40:05,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:40:05,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-24 20:40:05,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:40:05,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 20:40:05,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:40:05,150 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-24 20:40:05,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:40:05,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599107382] [2024-10-24 20:40:05,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599107382] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:40:05,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 20:40:05,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 20:40:05,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213681759] [2024-10-24 20:40:05,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:40:05,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 20:40:05,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:40:05,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 20:40:05,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-24 20:40:05,153 INFO L87 Difference]: Start difference. First operand 88 states and 108 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-24 20:40:05,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:40:05,290 INFO L93 Difference]: Finished difference Result 92 states and 120 transitions. [2024-10-24 20:40:05,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 20:40:05,291 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 34 [2024-10-24 20:40:05,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:40:05,291 INFO L225 Difference]: With dead ends: 92 [2024-10-24 20:40:05,291 INFO L226 Difference]: Without dead ends: 0 [2024-10-24 20:40:05,293 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2024-10-24 20:40:05,293 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 15 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 20:40:05,294 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 65 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 20:40:05,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-24 20:40:05,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-24 20:40:05,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 20:40:05,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-24 20:40:05,295 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 34 [2024-10-24 20:40:05,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:40:05,295 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-24 20:40:05,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-24 20:40:05,295 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-24 20:40:05,295 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-24 20:40:05,297 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2024-10-24 20:40:05,298 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2024-10-24 20:40:05,298 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2024-10-24 20:40:05,298 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f91Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2024-10-24 20:40:05,298 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f91Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2024-10-24 20:40:05,298 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f91Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2024-10-24 20:40:05,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 20:40:05,301 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 20:40:05,304 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-24 20:40:05,831 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 20:40:05,859 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 08:40:05 BoogieIcfgContainer [2024-10-24 20:40:05,861 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 20:40:05,861 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 20:40:05,862 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 20:40:05,862 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 20:40:05,862 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:40:02" (3/4) ... [2024-10-24 20:40:05,864 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-24 20:40:05,868 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure f91 [2024-10-24 20:40:05,872 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-10-24 20:40:05,872 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-24 20:40:05,872 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-24 20:40:05,873 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-24 20:40:05,966 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-24 20:40:05,966 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-24 20:40:05,966 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 20:40:05,967 INFO L158 Benchmark]: Toolchain (without parser) took 4526.66ms. Allocated memory was 142.6MB in the beginning and 205.5MB in the end (delta: 62.9MB). Free memory was 72.0MB in the beginning and 156.3MB in the end (delta: -84.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 20:40:05,967 INFO L158 Benchmark]: CDTParser took 0.95ms. Allocated memory is still 142.6MB. Free memory is still 91.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 20:40:05,968 INFO L158 Benchmark]: CACSL2BoogieTranslator took 308.02ms. Allocated memory was 142.6MB in the beginning and 205.5MB in the end (delta: 62.9MB). Free memory was 71.9MB in the beginning and 174.8MB in the end (delta: -103.0MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. [2024-10-24 20:40:05,968 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.22ms. Allocated memory is still 205.5MB. Free memory was 174.8MB in the beginning and 173.5MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 20:40:05,968 INFO L158 Benchmark]: Boogie Preprocessor took 37.53ms. Allocated memory is still 205.5MB. Free memory was 173.5MB in the beginning and 172.5MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 20:40:05,969 INFO L158 Benchmark]: RCFGBuilder took 386.17ms. Allocated memory is still 205.5MB. Free memory was 172.5MB in the beginning and 160.1MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-24 20:40:05,969 INFO L158 Benchmark]: TraceAbstraction took 3652.47ms. Allocated memory is still 205.5MB. Free memory was 159.0MB in the beginning and 160.5MB in the end (delta: -1.6MB). Peak memory consumption was 99.2MB. Max. memory is 16.1GB. [2024-10-24 20:40:05,969 INFO L158 Benchmark]: Witness Printer took 105.10ms. Allocated memory is still 205.5MB. Free memory was 160.5MB in the beginning and 156.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 20:40:05,971 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.95ms. Allocated memory is still 142.6MB. Free memory is still 91.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 308.02ms. Allocated memory was 142.6MB in the beginning and 205.5MB in the end (delta: 62.9MB). Free memory was 71.9MB in the beginning and 174.8MB in the end (delta: -103.0MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.22ms. Allocated memory is still 205.5MB. Free memory was 174.8MB in the beginning and 173.5MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.53ms. Allocated memory is still 205.5MB. Free memory was 173.5MB in the beginning and 172.5MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 386.17ms. Allocated memory is still 205.5MB. Free memory was 172.5MB in the beginning and 160.1MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 3652.47ms. Allocated memory is still 205.5MB. Free memory was 159.0MB in the beginning and 160.5MB in the end (delta: -1.6MB). Peak memory consumption was 99.2MB. Max. memory is 16.1GB. * Witness Printer took 105.10ms. Allocated memory is still 205.5MB. Free memory was 160.5MB in the beginning and 156.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 19]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 19]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 21]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 21]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 29 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 3.0s, OverallIterations: 9, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 178 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 167 mSDsluCounter, 420 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 258 mSDsCounter, 86 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 519 IncrementalHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 86 mSolverCounterUnsat, 162 mSDtfsCounter, 519 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 117 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=89occurred in iteration=7, InterpolantAutomatonStates: 68, 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, 9 MinimizatonAttempts, 45 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 135 NumberOfCodeBlocks, 135 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 143 ConstructedInterpolants, 0 QuantifiedInterpolants, 362 SizeOfPredicates, 3 NumberOfNonLiveVariables, 57 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 11 InterpolantComputations, 8 PerfectInterpolantSequences, 54/68 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: 17]: Procedure Contract for f91 Derived contract for procedure f91. Requires: (((x <= 2147483648) && (91 <= x)) || ((x <= 2147483647) && (0 <= (x + 2147483648)))) Ensures: ((((91 <= \result) && (((((long long) \result + 10) <= x) && (x <= 2147483648)) || (x < 101))) && (\result <= 2147483657)) && (0 <= (x + 2147483648))) RESULT: Ultimate proved your program to be correct! [2024-10-24 20:40:05,992 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