./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_min_postdec_11_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_min_postdec_11_good.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 64bit --witnessprinter.graph.data.programhash fa5ae6c2527ebd11f7510cac1531f24c50e68df9c11b670327453eb5f8a744ee --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 23:15:24,801 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 23:15:24,896 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-10-11 23:15:24,903 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 23:15:24,904 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 23:15:24,938 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 23:15:24,938 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 23:15:24,939 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 23:15:24,940 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 23:15:24,941 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 23:15:24,941 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 23:15:24,942 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 23:15:24,942 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 23:15:24,943 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 23:15:24,943 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 23:15:24,945 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 23:15:24,945 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 23:15:24,946 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 23:15:24,946 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 23:15:24,946 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 23:15:24,946 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 23:15:24,950 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 23:15:24,951 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 23:15:24,951 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 23:15:24,951 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 23:15:24,951 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 23:15:24,951 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 23:15:24,952 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 23:15:24,952 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 23:15:24,952 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 23:15:24,952 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 23:15:24,953 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 23:15:24,953 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 23:15:24,953 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 23:15:24,953 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 23:15:24,953 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 23:15:24,954 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 23:15:24,954 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 23:15:24,957 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 23:15:24,957 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 23:15:24,957 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 23:15:24,958 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-clean/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-clean/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fa5ae6c2527ebd11f7510cac1531f24c50e68df9c11b670327453eb5f8a744ee [2024-10-11 23:15:25,193 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 23:15:25,216 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 23:15:25,219 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 23:15:25,220 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 23:15:25,220 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 23:15:25,221 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_min_postdec_11_good.i [2024-10-11 23:15:26,614 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 23:15:26,953 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 23:15:26,954 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_min_postdec_11_good.i [2024-10-11 23:15:26,985 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/515ea6fc4/28e1aca958ca4ade8a294708a93b84e2/FLAG9c766cc1a [2024-10-11 23:15:27,002 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/515ea6fc4/28e1aca958ca4ade8a294708a93b84e2 [2024-10-11 23:15:27,006 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 23:15:27,008 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 23:15:27,009 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 23:15:27,010 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 23:15:27,016 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 23:15:27,018 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:15:27" (1/1) ... [2024-10-11 23:15:27,019 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cab336a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:15:27, skipping insertion in model container [2024-10-11 23:15:27,019 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:15:27" (1/1) ... [2024-10-11 23:15:27,090 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 23:15:27,826 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 23:15:27,835 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 23:15:27,920 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 23:15:28,032 INFO L204 MainTranslator]: Completed translation [2024-10-11 23:15:28,033 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:15:28 WrapperNode [2024-10-11 23:15:28,033 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 23:15:28,034 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 23:15:28,034 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 23:15:28,034 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 23:15:28,043 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:15:28" (1/1) ... [2024-10-11 23:15:28,071 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:15:28" (1/1) ... [2024-10-11 23:15:28,103 INFO L138 Inliner]: procedures = 501, calls = 46, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 133 [2024-10-11 23:15:28,104 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 23:15:28,105 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 23:15:28,105 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 23:15:28,105 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 23:15:28,119 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:15:28" (1/1) ... [2024-10-11 23:15:28,119 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:15:28" (1/1) ... [2024-10-11 23:15:28,122 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:15:28" (1/1) ... [2024-10-11 23:15:28,139 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-11 23:15:28,139 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:15:28" (1/1) ... [2024-10-11 23:15:28,139 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:15:28" (1/1) ... [2024-10-11 23:15:28,145 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:15:28" (1/1) ... [2024-10-11 23:15:28,147 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:15:28" (1/1) ... [2024-10-11 23:15:28,149 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:15:28" (1/1) ... [2024-10-11 23:15:28,150 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:15:28" (1/1) ... [2024-10-11 23:15:28,154 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 23:15:28,155 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 23:15:28,155 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 23:15:28,155 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 23:15:28,156 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:15:28" (1/1) ... [2024-10-11 23:15:28,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 23:15:28,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 23:15:28,199 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 23:15:28,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 23:15:28,255 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2024-10-11 23:15:28,256 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2024-10-11 23:15:28,256 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-10-11 23:15:28,256 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-10-11 23:15:28,256 INFO L130 BoogieDeclarations]: Found specification of procedure globalReturnsTrue [2024-10-11 23:15:28,256 INFO L138 BoogieDeclarations]: Found implementation of procedure globalReturnsTrue [2024-10-11 23:15:28,256 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 23:15:28,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 23:15:28,257 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 23:15:28,257 INFO L130 BoogieDeclarations]: Found specification of procedure globalReturnsFalse [2024-10-11 23:15:28,257 INFO L138 BoogieDeclarations]: Found implementation of procedure globalReturnsFalse [2024-10-11 23:15:28,408 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 23:15:28,413 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 23:15:28,656 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2024-10-11 23:15:28,656 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 23:15:28,698 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 23:15:28,698 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 23:15:28,698 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:15:28 BoogieIcfgContainer [2024-10-11 23:15:28,699 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 23:15:28,701 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 23:15:28,701 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 23:15:28,706 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 23:15:28,707 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:15:27" (1/3) ... [2024-10-11 23:15:28,707 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b3d5655 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:15:28, skipping insertion in model container [2024-10-11 23:15:28,707 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:15:28" (2/3) ... [2024-10-11 23:15:28,708 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b3d5655 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:15:28, skipping insertion in model container [2024-10-11 23:15:28,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:15:28" (3/3) ... [2024-10-11 23:15:28,709 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_min_postdec_11_good.i [2024-10-11 23:15:28,724 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 23:15:28,724 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-10-11 23:15:28,785 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 23:15:28,792 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;@11b27b17, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 23:15:28,792 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-10-11 23:15:28,796 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 47 states have (on average 1.4042553191489362) internal successors, (66), 55 states have internal predecessors, (66), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 23:15:28,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 23:15:28,802 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:15:28,803 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:15:28,803 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 23:15:28,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:15:28,808 INFO L85 PathProgramCache]: Analyzing trace with hash 55766273, now seen corresponding path program 1 times [2024-10-11 23:15:28,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:15:28,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680791440] [2024-10-11 23:15:28,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:15:28,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:15:28,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:29,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:15:29,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:29,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 23:15:29,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:29,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 23:15:29,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:29,128 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-11 23:15:29,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:15:29,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680791440] [2024-10-11 23:15:29,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680791440] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:15:29,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:15:29,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 23:15:29,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241165589] [2024-10-11 23:15:29,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:15:29,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 23:15:29,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:15:29,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 23:15:29,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 23:15:29,166 INFO L87 Difference]: Start difference. First operand has 78 states, 47 states have (on average 1.4042553191489362) internal successors, (66), 55 states have internal predecessors, (66), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 23:15:29,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:15:29,220 INFO L93 Difference]: Finished difference Result 149 states and 193 transitions. [2024-10-11 23:15:29,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 23:15:29,222 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 19 [2024-10-11 23:15:29,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:15:29,229 INFO L225 Difference]: With dead ends: 149 [2024-10-11 23:15:29,230 INFO L226 Difference]: Without dead ends: 79 [2024-10-11 23:15:29,233 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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-11 23:15:29,236 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 2 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:15:29,236 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 189 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:15:29,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-11 23:15:29,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2024-10-11 23:15:29,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 47 states have (on average 1.3829787234042554) internal successors, (65), 54 states have internal predecessors, (65), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 23:15:29,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 99 transitions. [2024-10-11 23:15:29,275 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 99 transitions. Word has length 19 [2024-10-11 23:15:29,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:15:29,275 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 99 transitions. [2024-10-11 23:15:29,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 23:15:29,276 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 99 transitions. [2024-10-11 23:15:29,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 23:15:29,277 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:15:29,279 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:15:29,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 23:15:29,280 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 23:15:29,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:15:29,281 INFO L85 PathProgramCache]: Analyzing trace with hash -753580353, now seen corresponding path program 1 times [2024-10-11 23:15:29,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:15:29,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545180366] [2024-10-11 23:15:29,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:15:29,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:15:29,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:29,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:15:29,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:29,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 23:15:29,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:29,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 23:15:29,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:29,485 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-11 23:15:29,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:15:29,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545180366] [2024-10-11 23:15:29,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545180366] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:15:29,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:15:29,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 23:15:29,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281329573] [2024-10-11 23:15:29,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:15:29,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 23:15:29,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:15:29,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 23:15:29,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 23:15:29,492 INFO L87 Difference]: Start difference. First operand 76 states and 99 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 23:15:29,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:15:29,537 INFO L93 Difference]: Finished difference Result 132 states and 169 transitions. [2024-10-11 23:15:29,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 23:15:29,537 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 19 [2024-10-11 23:15:29,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:15:29,539 INFO L225 Difference]: With dead ends: 132 [2024-10-11 23:15:29,539 INFO L226 Difference]: Without dead ends: 66 [2024-10-11 23:15:29,540 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 23:15:29,541 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:15:29,541 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 231 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:15:29,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-11 23:15:29,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-10-11 23:15:29,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 46 states have internal predecessors, (54), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 23:15:29,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 84 transitions. [2024-10-11 23:15:29,551 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 84 transitions. Word has length 19 [2024-10-11 23:15:29,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:15:29,553 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 84 transitions. [2024-10-11 23:15:29,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 23:15:29,554 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 84 transitions. [2024-10-11 23:15:29,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-11 23:15:29,556 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:15:29,556 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:15:29,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 23:15:29,557 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 23:15:29,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:15:29,558 INFO L85 PathProgramCache]: Analyzing trace with hash -447765931, now seen corresponding path program 1 times [2024-10-11 23:15:29,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:15:29,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078458166] [2024-10-11 23:15:29,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:15:29,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:15:29,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:29,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:15:29,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:29,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 23:15:29,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:29,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 23:15:29,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:29,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 23:15:29,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:29,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 23:15:29,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:29,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 23:15:29,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:29,699 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-11 23:15:29,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:15:29,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078458166] [2024-10-11 23:15:29,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078458166] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:15:29,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:15:29,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 23:15:29,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783682530] [2024-10-11 23:15:29,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:15:29,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 23:15:29,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:15:29,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 23:15:29,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 23:15:29,705 INFO L87 Difference]: Start difference. First operand 66 states and 84 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 23:15:29,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:15:29,734 INFO L93 Difference]: Finished difference Result 118 states and 148 transitions. [2024-10-11 23:15:29,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 23:15:29,735 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 36 [2024-10-11 23:15:29,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:15:29,736 INFO L225 Difference]: With dead ends: 118 [2024-10-11 23:15:29,736 INFO L226 Difference]: Without dead ends: 64 [2024-10-11 23:15:29,737 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 23:15:29,738 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 0 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:15:29,738 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 219 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:15:29,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-11 23:15:29,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-10-11 23:15:29,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 40 states have (on average 1.3) internal successors, (52), 45 states have internal predecessors, (52), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 23:15:29,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 80 transitions. [2024-10-11 23:15:29,746 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 80 transitions. Word has length 36 [2024-10-11 23:15:29,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:15:29,747 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 80 transitions. [2024-10-11 23:15:29,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 23:15:29,747 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 80 transitions. [2024-10-11 23:15:29,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-11 23:15:29,748 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:15:29,748 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:15:29,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 23:15:29,749 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 23:15:29,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:15:29,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1249086082, now seen corresponding path program 1 times [2024-10-11 23:15:29,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:15:29,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015933247] [2024-10-11 23:15:29,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:15:29,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:15:29,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:29,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:15:29,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:29,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 23:15:29,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:29,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 23:15:29,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:29,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 23:15:29,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:29,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 23:15:29,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:29,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 23:15:29,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:29,859 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-11 23:15:29,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:15:29,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015933247] [2024-10-11 23:15:29,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015933247] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:15:29,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:15:29,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 23:15:29,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4315312] [2024-10-11 23:15:29,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:15:29,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 23:15:29,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:15:29,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 23:15:29,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 23:15:29,865 INFO L87 Difference]: Start difference. First operand 64 states and 80 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 23:15:29,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:15:29,899 INFO L93 Difference]: Finished difference Result 111 states and 136 transitions. [2024-10-11 23:15:29,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 23:15:29,900 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 37 [2024-10-11 23:15:29,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:15:29,901 INFO L225 Difference]: With dead ends: 111 [2024-10-11 23:15:29,901 INFO L226 Difference]: Without dead ends: 69 [2024-10-11 23:15:29,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 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-11 23:15:29,903 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 1 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 152 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-11 23:15:29,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 152 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:15:29,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-10-11 23:15:29,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2024-10-11 23:15:29,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 43 states have (on average 1.302325581395349) internal successors, (56), 48 states have internal predecessors, (56), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 23:15:29,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 86 transitions. [2024-10-11 23:15:29,911 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 86 transitions. Word has length 37 [2024-10-11 23:15:29,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:15:29,912 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 86 transitions. [2024-10-11 23:15:29,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 23:15:29,912 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 86 transitions. [2024-10-11 23:15:29,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-11 23:15:29,913 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:15:29,913 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:15:29,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 23:15:29,914 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 23:15:29,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:15:29,914 INFO L85 PathProgramCache]: Analyzing trace with hash -2058432708, now seen corresponding path program 1 times [2024-10-11 23:15:29,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:15:29,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995705022] [2024-10-11 23:15:29,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:15:29,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:15:29,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:29,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:15:29,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:29,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 23:15:29,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:29,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 23:15:30,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:30,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 23:15:30,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:30,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 23:15:30,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:30,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 23:15:30,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:30,033 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 23:15:30,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:15:30,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995705022] [2024-10-11 23:15:30,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995705022] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 23:15:30,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1829311780] [2024-10-11 23:15:30,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:15:30,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 23:15:30,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 23:15:30,042 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 23:15:30,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 23:15:30,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:30,156 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 23:15:30,161 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 23:15:30,216 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 23:15:30,217 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 23:15:30,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1829311780] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:15:30,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 23:15:30,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-10-11 23:15:30,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366919862] [2024-10-11 23:15:30,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:15:30,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 23:15:30,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:15:30,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 23:15:30,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 23:15:30,224 INFO L87 Difference]: Start difference. First operand 68 states and 86 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 23:15:30,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:15:30,258 INFO L93 Difference]: Finished difference Result 106 states and 130 transitions. [2024-10-11 23:15:30,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 23:15:30,259 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 37 [2024-10-11 23:15:30,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:15:30,260 INFO L225 Difference]: With dead ends: 106 [2024-10-11 23:15:30,260 INFO L226 Difference]: Without dead ends: 58 [2024-10-11 23:15:30,261 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 23:15:30,262 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 0 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:15:30,262 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 192 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:15:30,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-10-11 23:15:30,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-10-11 23:15:30,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 40 states have internal predecessors, (45), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 23:15:30,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 71 transitions. [2024-10-11 23:15:30,273 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 71 transitions. Word has length 37 [2024-10-11 23:15:30,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:15:30,273 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 71 transitions. [2024-10-11 23:15:30,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 23:15:30,273 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 71 transitions. [2024-10-11 23:15:30,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-11 23:15:30,277 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:15:30,277 INFO L215 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:15:30,291 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 23:15:30,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 23:15:30,478 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 23:15:30,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:15:30,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1531266017, now seen corresponding path program 1 times [2024-10-11 23:15:30,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:15:30,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701930643] [2024-10-11 23:15:30,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:15:30,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:15:30,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:30,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:15:30,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:30,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 23:15:30,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:30,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 23:15:30,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:30,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 23:15:30,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:30,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 23:15:30,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:30,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 23:15:30,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:30,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 23:15:30,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:30,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 23:15:30,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:30,604 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 23:15:30,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:15:30,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701930643] [2024-10-11 23:15:30,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701930643] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 23:15:30,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1185090079] [2024-10-11 23:15:30,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:15:30,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 23:15:30,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 23:15:30,612 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 23:15:30,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 23:15:30,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:30,702 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 23:15:30,704 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 23:15:30,734 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 23:15:30,738 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 23:15:30,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1185090079] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:15:30,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 23:15:30,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-10-11 23:15:30,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543620712] [2024-10-11 23:15:30,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:15:30,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 23:15:30,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:15:30,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 23:15:30,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 23:15:30,740 INFO L87 Difference]: Start difference. First operand 58 states and 71 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 23:15:30,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:15:30,763 INFO L93 Difference]: Finished difference Result 94 states and 112 transitions. [2024-10-11 23:15:30,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 23:15:30,763 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 47 [2024-10-11 23:15:30,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:15:30,764 INFO L225 Difference]: With dead ends: 94 [2024-10-11 23:15:30,764 INFO L226 Difference]: Without dead ends: 58 [2024-10-11 23:15:30,765 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 23:15:30,766 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 0 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:15:30,766 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 189 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:15:30,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-10-11 23:15:30,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-10-11 23:15:30,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 40 states have internal predecessors, (44), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 23:15:30,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 70 transitions. [2024-10-11 23:15:30,779 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 70 transitions. Word has length 47 [2024-10-11 23:15:30,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:15:30,780 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 70 transitions. [2024-10-11 23:15:30,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 23:15:30,781 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 70 transitions. [2024-10-11 23:15:30,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-11 23:15:30,783 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:15:30,783 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:15:30,801 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 23:15:30,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 23:15:30,984 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 23:15:30,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:15:30,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1448533612, now seen corresponding path program 1 times [2024-10-11 23:15:30,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:15:30,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072002592] [2024-10-11 23:15:30,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:15:30,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:15:31,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:31,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:15:31,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:31,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 23:15:31,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:31,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 23:15:31,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:31,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 23:15:31,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:31,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 23:15:31,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:31,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 23:15:31,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:31,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 23:15:31,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:31,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 23:15:31,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:31,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 23:15:31,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:31,080 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-11 23:15:31,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:15:31,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072002592] [2024-10-11 23:15:31,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072002592] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:15:31,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:15:31,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 23:15:31,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093497921] [2024-10-11 23:15:31,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:15:31,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 23:15:31,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:15:31,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 23:15:31,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 23:15:31,083 INFO L87 Difference]: Start difference. First operand 58 states and 70 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-11 23:15:31,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:15:31,113 INFO L93 Difference]: Finished difference Result 59 states and 71 transitions. [2024-10-11 23:15:31,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 23:15:31,113 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 54 [2024-10-11 23:15:31,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:15:31,114 INFO L225 Difference]: With dead ends: 59 [2024-10-11 23:15:31,115 INFO L226 Difference]: Without dead ends: 58 [2024-10-11 23:15:31,116 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 23:15:31,116 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 5 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:15:31,117 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 170 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:15:31,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-10-11 23:15:31,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2024-10-11 23:15:31,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 37 states have (on average 1.162162162162162) internal successors, (43), 39 states have internal predecessors, (43), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 23:15:31,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 69 transitions. [2024-10-11 23:15:31,127 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 69 transitions. Word has length 54 [2024-10-11 23:15:31,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:15:31,128 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 69 transitions. [2024-10-11 23:15:31,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-11 23:15:31,128 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2024-10-11 23:15:31,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-11 23:15:31,129 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:15:31,129 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:15:31,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 23:15:31,130 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 23:15:31,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:15:31,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1954868884, now seen corresponding path program 1 times [2024-10-11 23:15:31,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:15:31,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000876756] [2024-10-11 23:15:31,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:15:31,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:15:31,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:31,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:15:31,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:31,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 23:15:31,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:31,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 23:15:31,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:31,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 23:15:31,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:31,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 23:15:31,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:31,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 23:15:31,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:31,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 23:15:31,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:31,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 23:15:31,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:31,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 23:15:31,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:31,230 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-11 23:15:31,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:15:31,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000876756] [2024-10-11 23:15:31,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000876756] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:15:31,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:15:31,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 23:15:31,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481829092] [2024-10-11 23:15:31,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:15:31,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 23:15:31,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:15:31,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 23:15:31,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 23:15:31,234 INFO L87 Difference]: Start difference. First operand 57 states and 69 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-11 23:15:31,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:15:31,263 INFO L93 Difference]: Finished difference Result 64 states and 78 transitions. [2024-10-11 23:15:31,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 23:15:31,263 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 55 [2024-10-11 23:15:31,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:15:31,264 INFO L225 Difference]: With dead ends: 64 [2024-10-11 23:15:31,264 INFO L226 Difference]: Without dead ends: 63 [2024-10-11 23:15:31,264 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 23:15:31,265 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 1 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:15:31,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 180 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:15:31,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-11 23:15:31,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2024-10-11 23:15:31,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 41 states have (on average 1.170731707317073) internal successors, (48), 43 states have internal predecessors, (48), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 23:15:31,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 76 transitions. [2024-10-11 23:15:31,278 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 76 transitions. Word has length 55 [2024-10-11 23:15:31,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:15:31,279 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 76 transitions. [2024-10-11 23:15:31,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-11 23:15:31,279 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 76 transitions. [2024-10-11 23:15:31,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-11 23:15:31,281 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:15:31,281 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:15:31,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 23:15:31,281 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 23:15:31,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:15:31,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1788598603, now seen corresponding path program 1 times [2024-10-11 23:15:31,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:15:31,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849206346] [2024-10-11 23:15:31,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:15:31,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:15:31,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:31,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:15:31,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:31,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 23:15:31,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:31,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 23:15:31,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:31,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 23:15:31,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:31,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 23:15:31,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:31,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 23:15:31,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:31,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 23:15:31,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:31,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 23:15:31,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:31,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 23:15:31,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:31,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 23:15:31,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:31,398 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-10-11 23:15:31,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:15:31,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849206346] [2024-10-11 23:15:31,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849206346] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:15:31,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:15:31,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 23:15:31,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096363280] [2024-10-11 23:15:31,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:15:31,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 23:15:31,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:15:31,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 23:15:31,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 23:15:31,400 INFO L87 Difference]: Start difference. First operand 62 states and 76 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-11 23:15:31,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:15:31,421 INFO L93 Difference]: Finished difference Result 83 states and 98 transitions. [2024-10-11 23:15:31,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 23:15:31,422 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 61 [2024-10-11 23:15:31,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:15:31,423 INFO L225 Difference]: With dead ends: 83 [2024-10-11 23:15:31,423 INFO L226 Difference]: Without dead ends: 54 [2024-10-11 23:15:31,423 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 23:15:31,424 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 0 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:15:31,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 171 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:15:31,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-10-11 23:15:31,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-10-11 23:15:31,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 37 states have internal predecessors, (40), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 23:15:31,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2024-10-11 23:15:31,437 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 61 [2024-10-11 23:15:31,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:15:31,437 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2024-10-11 23:15:31,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-11 23:15:31,437 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2024-10-11 23:15:31,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-11 23:15:31,441 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:15:31,441 INFO L215 NwaCegarLoop]: trace histogram [6, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:15:31,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 23:15:31,442 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 23:15:31,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:15:31,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1868968227, now seen corresponding path program 1 times [2024-10-11 23:15:31,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:15:31,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608726599] [2024-10-11 23:15:31,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:15:31,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:15:31,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:31,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:15:31,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:31,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 23:15:31,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:31,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 23:15:31,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:31,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 23:15:31,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:31,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 23:15:31,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:31,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 23:15:31,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:31,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 23:15:31,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:31,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 23:15:31,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:31,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 23:15:31,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:31,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 23:15:31,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:31,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 23:15:31,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:31,554 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-10-11 23:15:31,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:15:31,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608726599] [2024-10-11 23:15:31,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608726599] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 23:15:31,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1830416048] [2024-10-11 23:15:31,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:15:31,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 23:15:31,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 23:15:31,557 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 23:15:31,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 23:15:31,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:31,644 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 23:15:31,646 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 23:15:31,667 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-10-11 23:15:31,667 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 23:15:31,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1830416048] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:15:31,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 23:15:31,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-10-11 23:15:31,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57368842] [2024-10-11 23:15:31,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:15:31,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 23:15:31,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:15:31,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 23:15:31,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 23:15:31,669 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 23:15:31,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:15:31,688 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2024-10-11 23:15:31,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 23:15:31,689 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) Word has length 65 [2024-10-11 23:15:31,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:15:31,690 INFO L225 Difference]: With dead ends: 67 [2024-10-11 23:15:31,690 INFO L226 Difference]: Without dead ends: 54 [2024-10-11 23:15:31,690 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 23:15:31,691 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 0 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:15:31,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 168 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:15:31,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-10-11 23:15:31,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-10-11 23:15:31,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 37 states have internal predecessors, (39), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 23:15:31,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2024-10-11 23:15:31,696 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 65 [2024-10-11 23:15:31,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:15:31,696 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2024-10-11 23:15:31,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 23:15:31,697 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2024-10-11 23:15:31,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-11 23:15:31,697 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:15:31,698 INFO L215 NwaCegarLoop]: trace histogram [6, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:15:31,715 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 23:15:31,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 23:15:31,899 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 23:15:31,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:15:31,899 INFO L85 PathProgramCache]: Analyzing trace with hash 562358274, now seen corresponding path program 1 times [2024-10-11 23:15:31,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:15:31,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512610123] [2024-10-11 23:15:31,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:15:31,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:15:31,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:31,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:15:31,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:31,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 23:15:31,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:31,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 23:15:31,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:31,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 23:15:31,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:31,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 23:15:31,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:31,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 23:15:31,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:31,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 23:15:31,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:32,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 23:15:32,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:32,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 23:15:32,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:32,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 23:15:32,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:32,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 23:15:32,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:32,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 23:15:32,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:32,016 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-10-11 23:15:32,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:15:32,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512610123] [2024-10-11 23:15:32,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512610123] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:15:32,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:15:32,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 23:15:32,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880074671] [2024-10-11 23:15:32,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:15:32,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 23:15:32,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:15:32,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 23:15:32,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 23:15:32,018 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 23:15:32,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:15:32,042 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2024-10-11 23:15:32,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 23:15:32,042 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 71 [2024-10-11 23:15:32,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:15:32,043 INFO L225 Difference]: With dead ends: 54 [2024-10-11 23:15:32,043 INFO L226 Difference]: Without dead ends: 53 [2024-10-11 23:15:32,043 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 23:15:32,044 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 3 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:15:32,044 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 157 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:15:32,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-10-11 23:15:32,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-10-11 23:15:32,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 23:15:32,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2024-10-11 23:15:32,054 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 62 transitions. Word has length 71 [2024-10-11 23:15:32,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:15:32,054 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 62 transitions. [2024-10-11 23:15:32,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 23:15:32,055 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2024-10-11 23:15:32,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-11 23:15:32,056 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:15:32,056 INFO L215 NwaCegarLoop]: trace histogram [6, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:15:32,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 23:15:32,056 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 23:15:32,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:15:32,056 INFO L85 PathProgramCache]: Analyzing trace with hash 253237461, now seen corresponding path program 1 times [2024-10-11 23:15:32,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:15:32,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297558000] [2024-10-11 23:15:32,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:15:32,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:15:32,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:32,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:15:32,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:32,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 23:15:32,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:32,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 23:15:32,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:32,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 23:15:32,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:32,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 23:15:32,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:32,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 23:15:32,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:32,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 23:15:32,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:32,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 23:15:32,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:32,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 23:15:32,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:32,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 23:15:32,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:32,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 23:15:32,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:32,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 23:15:32,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:32,144 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-10-11 23:15:32,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:15:32,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297558000] [2024-10-11 23:15:32,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297558000] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:15:32,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:15:32,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 23:15:32,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113604853] [2024-10-11 23:15:32,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:15:32,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 23:15:32,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:15:32,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 23:15:32,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 23:15:32,148 INFO L87 Difference]: Start difference. First operand 53 states and 62 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 23:15:32,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:15:32,169 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2024-10-11 23:15:32,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 23:15:32,169 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 72 [2024-10-11 23:15:32,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:15:32,170 INFO L225 Difference]: With dead ends: 59 [2024-10-11 23:15:32,170 INFO L226 Difference]: Without dead ends: 53 [2024-10-11 23:15:32,171 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 23:15:32,171 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 0 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:15:32,171 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 171 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:15:32,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-10-11 23:15:32,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-10-11 23:15:32,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 23:15:32,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2024-10-11 23:15:32,176 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 72 [2024-10-11 23:15:32,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:15:32,176 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2024-10-11 23:15:32,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 23:15:32,176 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2024-10-11 23:15:32,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-11 23:15:32,177 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:15:32,177 INFO L215 NwaCegarLoop]: trace histogram [6, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:15:32,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 23:15:32,178 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 23:15:32,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:15:32,178 INFO L85 PathProgramCache]: Analyzing trace with hash -556109165, now seen corresponding path program 1 times [2024-10-11 23:15:32,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:15:32,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704845455] [2024-10-11 23:15:32,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:15:32,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:15:32,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:32,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:15:32,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:32,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 23:15:32,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:32,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 23:15:32,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:32,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 23:15:32,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:32,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 23:15:32,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:32,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 23:15:32,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:32,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 23:15:32,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:32,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 23:15:32,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:32,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 23:15:32,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:32,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 23:15:32,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:32,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 23:15:32,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:32,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 23:15:32,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:32,267 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-10-11 23:15:32,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:15:32,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704845455] [2024-10-11 23:15:32,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704845455] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 23:15:32,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [258731520] [2024-10-11 23:15:32,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:15:32,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 23:15:32,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 23:15:32,269 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 23:15:32,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 23:15:32,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:32,359 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 23:15:32,361 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 23:15:32,379 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 23:15:32,379 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 23:15:32,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [258731520] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:15:32,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 23:15:32,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-10-11 23:15:32,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264085790] [2024-10-11 23:15:32,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:15:32,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 23:15:32,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:15:32,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 23:15:32,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 23:15:32,381 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 23:15:32,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:15:32,396 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2024-10-11 23:15:32,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 23:15:32,396 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) Word has length 72 [2024-10-11 23:15:32,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:15:32,397 INFO L225 Difference]: With dead ends: 55 [2024-10-11 23:15:32,397 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 23:15:32,398 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 23:15:32,399 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:15:32,401 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 145 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:15:32,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 23:15:32,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 23:15:32,401 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-11 23:15:32,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 23:15:32,402 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 72 [2024-10-11 23:15:32,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:15:32,402 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 23:15:32,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 23:15:32,402 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 23:15:32,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 23:15:32,405 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2024-10-11 23:15:32,406 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2024-10-11 23:15:32,406 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2024-10-11 23:15:32,407 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2024-10-11 23:15:32,407 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2024-10-11 23:15:32,407 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2024-10-11 23:15:32,408 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2024-10-11 23:15:32,408 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2024-10-11 23:15:32,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-11 23:15:32,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-11 23:15:32,614 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:15:32,616 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 23:15:32,661 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 23:15:32,677 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 11:15:32 BoogieIcfgContainer [2024-10-11 23:15:32,677 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 23:15:32,678 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 23:15:32,678 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 23:15:32,678 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 23:15:32,678 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:15:28" (3/4) ... [2024-10-11 23:15:32,680 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 23:15:32,684 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2024-10-11 23:15:32,684 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure globalReturnsFalse [2024-10-11 23:15:32,684 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2024-10-11 23:15:32,685 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure globalReturnsTrue [2024-10-11 23:15:32,690 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2024-10-11 23:15:32,691 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2024-10-11 23:15:32,691 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 23:15:32,692 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 23:15:32,795 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 23:15:32,795 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 23:15:32,795 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 23:15:32,796 INFO L158 Benchmark]: Toolchain (without parser) took 5787.86ms. Allocated memory was 157.3MB in the beginning and 190.8MB in the end (delta: 33.6MB). Free memory was 87.8MB in the beginning and 59.3MB in the end (delta: 28.5MB). Peak memory consumption was 62.1MB. Max. memory is 16.1GB. [2024-10-11 23:15:32,796 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 90.2MB. Free memory is still 44.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 23:15:32,796 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1023.74ms. Allocated memory is still 157.3MB. Free memory was 87.4MB in the beginning and 72.7MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 23:15:32,797 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.22ms. Allocated memory is still 157.3MB. Free memory was 72.7MB in the beginning and 69.9MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 23:15:32,797 INFO L158 Benchmark]: Boogie Preprocessor took 49.23ms. Allocated memory is still 157.3MB. Free memory was 69.9MB in the beginning and 67.2MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 23:15:32,797 INFO L158 Benchmark]: RCFGBuilder took 544.17ms. Allocated memory was 157.3MB in the beginning and 190.8MB in the end (delta: 33.6MB). Free memory was 67.2MB in the beginning and 150.4MB in the end (delta: -83.2MB). Peak memory consumption was 25.8MB. Max. memory is 16.1GB. [2024-10-11 23:15:32,797 INFO L158 Benchmark]: TraceAbstraction took 3976.54ms. Allocated memory is still 190.8MB. Free memory was 149.3MB in the beginning and 65.6MB in the end (delta: 83.8MB). Peak memory consumption was 82.7MB. Max. memory is 16.1GB. [2024-10-11 23:15:32,798 INFO L158 Benchmark]: Witness Printer took 117.43ms. Allocated memory is still 190.8MB. Free memory was 65.6MB in the beginning and 59.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 23:15:32,799 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.16ms. Allocated memory is still 90.2MB. Free memory is still 44.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1023.74ms. Allocated memory is still 157.3MB. Free memory was 87.4MB in the beginning and 72.7MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.22ms. Allocated memory is still 157.3MB. Free memory was 72.7MB in the beginning and 69.9MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.23ms. Allocated memory is still 157.3MB. Free memory was 69.9MB in the beginning and 67.2MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 544.17ms. Allocated memory was 157.3MB in the beginning and 190.8MB in the end (delta: 33.6MB). Free memory was 67.2MB in the beginning and 150.4MB in the end (delta: -83.2MB). Peak memory consumption was 25.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3976.54ms. Allocated memory is still 190.8MB. Free memory was 149.3MB in the beginning and 65.6MB in the end (delta: 83.8MB). Peak memory consumption was 82.7MB. Max. memory is 16.1GB. * Witness Printer took 117.43ms. Allocated memory is still 190.8MB. Free memory was 65.6MB in the beginning and 59.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 1564]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1564]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1586]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1586]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1611]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1611]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1628]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1628]: 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 5 procedures, 78 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 3.8s, OverallIterations: 13, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 16 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12 mSDsluCounter, 2334 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1472 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 248 IncrementalHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 862 mSDtfsCounter, 248 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 470 GetRequests, 438 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=78occurred in iteration=0, InterpolantAutomatonStates: 50, 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, 13 MinimizatonAttempts, 6 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 866 NumberOfCodeBlocks, 866 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 849 ConstructedInterpolants, 0 QuantifiedInterpolants, 1019 SizeOfPredicates, 0 NumberOfNonLiveVariables, 726 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 17 InterpolantComputations, 13 PerfectInterpolantSequences, 425/430 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 8 specifications checked. All of them hold - ProcedureContractResult [Line: 1514]: Procedure Contract for globalReturnsFalse Derived contract for procedure globalReturnsFalse. Ensures: (\result == 0) - ProcedureContractResult [Line: 1510]: Procedure Contract for globalReturnsTrue Derived contract for procedure globalReturnsTrue. Ensures: (\result == 1) RESULT: Ultimate proved your program to be correct! [2024-10-11 23:15:32,830 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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