./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_08_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_min_postdec_08_good.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 8a6c77f9d60c801167e12488cbdb1cb0a083b368ce7731d254f73c04ba64ccbe --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 15:59:48,542 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 15:59:48,638 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-10-13 15:59:48,644 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 15:59:48,645 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 15:59:48,672 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 15:59:48,672 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 15:59:48,673 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 15:59:48,673 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 15:59:48,674 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 15:59:48,674 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 15:59:48,675 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 15:59:48,675 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 15:59:48,676 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 15:59:48,677 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 15:59:48,677 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 15:59:48,677 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 15:59:48,678 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 15:59:48,678 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 15:59:48,678 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 15:59:48,678 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 15:59:48,683 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 15:59:48,684 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 15:59:48,684 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-13 15:59:48,684 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 15:59:48,684 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 15:59:48,685 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 15:59:48,685 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 15:59:48,685 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 15:59:48,685 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 15:59:48,686 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 15:59:48,686 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 15:59:48,686 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 15:59:48,687 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 15:59:48,688 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 15:59:48,688 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 15:59:48,688 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 15:59:48,689 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 15:59:48,689 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 15:59:48,689 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 15:59:48,689 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 15:59:48,690 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8a6c77f9d60c801167e12488cbdb1cb0a083b368ce7731d254f73c04ba64ccbe [2024-10-13 15:59:48,980 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 15:59:49,003 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 15:59:49,006 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 15:59:49,007 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 15:59:49,008 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 15:59:49,009 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_08_good.i [2024-10-13 15:59:50,472 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 15:59:50,823 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 15:59:50,825 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_min_postdec_08_good.i [2024-10-13 15:59:50,850 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a470fb65f/94b15e3e775144e49a16a39e9275012c/FLAG0ad7f6ce5 [2024-10-13 15:59:51,066 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a470fb65f/94b15e3e775144e49a16a39e9275012c [2024-10-13 15:59:51,068 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 15:59:51,069 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 15:59:51,071 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 15:59:51,071 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 15:59:51,077 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 15:59:51,077 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:59:51" (1/1) ... [2024-10-13 15:59:51,078 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bed4826 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:59:51, skipping insertion in model container [2024-10-13 15:59:51,078 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:59:51" (1/1) ... [2024-10-13 15:59:51,143 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 15:59:52,199 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 15:59:52,212 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 15:59:52,306 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 15:59:52,429 INFO L204 MainTranslator]: Completed translation [2024-10-13 15:59:52,429 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:59:52 WrapperNode [2024-10-13 15:59:52,429 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 15:59:52,431 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 15:59:52,431 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 15:59:52,431 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 15:59:52,438 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:59:52" (1/1) ... [2024-10-13 15:59:52,475 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:59:52" (1/1) ... [2024-10-13 15:59:52,509 INFO L138 Inliner]: procedures = 503, calls = 46, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 133 [2024-10-13 15:59:52,511 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 15:59:52,512 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 15:59:52,512 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 15:59:52,512 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 15:59:52,524 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:59:52" (1/1) ... [2024-10-13 15:59:52,524 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:59:52" (1/1) ... [2024-10-13 15:59:52,529 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:59:52" (1/1) ... [2024-10-13 15:59:52,553 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-13 15:59:52,554 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:59:52" (1/1) ... [2024-10-13 15:59:52,554 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:59:52" (1/1) ... [2024-10-13 15:59:52,564 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:59:52" (1/1) ... [2024-10-13 15:59:52,569 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:59:52" (1/1) ... [2024-10-13 15:59:52,571 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:59:52" (1/1) ... [2024-10-13 15:59:52,575 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:59:52" (1/1) ... [2024-10-13 15:59:52,577 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 15:59:52,582 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 15:59:52,582 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 15:59:52,582 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 15:59:52,583 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:59:52" (1/1) ... [2024-10-13 15:59:52,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 15:59:52,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 15:59:52,612 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 15:59:52,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 15:59:52,651 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2024-10-13 15:59:52,651 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2024-10-13 15:59:52,651 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-10-13 15:59:52,651 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-10-13 15:59:52,651 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 15:59:52,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 15:59:52,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 15:59:52,652 INFO L130 BoogieDeclarations]: Found specification of procedure staticReturnsTrue [2024-10-13 15:59:52,652 INFO L138 BoogieDeclarations]: Found implementation of procedure staticReturnsTrue [2024-10-13 15:59:52,652 INFO L130 BoogieDeclarations]: Found specification of procedure staticReturnsFalse [2024-10-13 15:59:52,652 INFO L138 BoogieDeclarations]: Found implementation of procedure staticReturnsFalse [2024-10-13 15:59:52,781 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 15:59:52,783 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 15:59:52,995 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2024-10-13 15:59:52,996 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 15:59:53,034 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 15:59:53,035 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-13 15:59:53,035 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:59:53 BoogieIcfgContainer [2024-10-13 15:59:53,035 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 15:59:53,038 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 15:59:53,038 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 15:59:53,042 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 15:59:53,043 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 03:59:51" (1/3) ... [2024-10-13 15:59:53,043 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29d7c7e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:59:53, skipping insertion in model container [2024-10-13 15:59:53,044 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:59:52" (2/3) ... [2024-10-13 15:59:53,044 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29d7c7e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:59:53, skipping insertion in model container [2024-10-13 15:59:53,044 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:59:53" (3/3) ... [2024-10-13 15:59:53,045 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_min_postdec_08_good.i [2024-10-13 15:59:53,063 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 15:59:53,063 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-10-13 15:59:53,133 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 15:59:53,139 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;@7715390f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 15:59:53,140 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-10-13 15:59:53,144 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-13 15:59:53,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-13 15:59:53,152 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 15:59:53,153 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-13 15:59:53,154 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-13 15:59:53,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 15:59:53,159 INFO L85 PathProgramCache]: Analyzing trace with hash 55766273, now seen corresponding path program 1 times [2024-10-13 15:59:53,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 15:59:53,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530556827] [2024-10-13 15:59:53,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 15:59:53,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 15:59:53,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:53,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 15:59:53,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:53,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 15:59:53,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:53,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 15:59:53,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:53,579 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-13 15:59:53,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 15:59:53,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530556827] [2024-10-13 15:59:53,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530556827] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 15:59:53,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 15:59:53,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 15:59:53,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198852885] [2024-10-13 15:59:53,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 15:59:53,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 15:59:53,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 15:59:53,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 15:59:53,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 15:59:53,608 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-13 15:59:53,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 15:59:53,674 INFO L93 Difference]: Finished difference Result 149 states and 193 transitions. [2024-10-13 15:59:53,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 15:59:53,676 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-13 15:59:53,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 15:59:53,686 INFO L225 Difference]: With dead ends: 149 [2024-10-13 15:59:53,686 INFO L226 Difference]: Without dead ends: 79 [2024-10-13 15:59:53,691 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-13 15:59:53,695 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-13 15:59:53,698 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-13 15:59:53,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-13 15:59:53,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2024-10-13 15:59:53,744 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-13 15:59:53,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 99 transitions. [2024-10-13 15:59:53,749 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 99 transitions. Word has length 19 [2024-10-13 15:59:53,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 15:59:53,751 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 99 transitions. [2024-10-13 15:59:53,751 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-13 15:59:53,751 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 99 transitions. [2024-10-13 15:59:53,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-13 15:59:53,753 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 15:59:53,753 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-13 15:59:53,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 15:59:53,754 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-13 15:59:53,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 15:59:53,755 INFO L85 PathProgramCache]: Analyzing trace with hash -753580353, now seen corresponding path program 1 times [2024-10-13 15:59:53,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 15:59:53,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718165745] [2024-10-13 15:59:53,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 15:59:53,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 15:59:53,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:53,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 15:59:53,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:53,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 15:59:53,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:53,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 15:59:53,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:53,912 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-13 15:59:53,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 15:59:53,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718165745] [2024-10-13 15:59:53,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718165745] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 15:59:53,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 15:59:53,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 15:59:53,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272964879] [2024-10-13 15:59:53,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 15:59:53,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 15:59:53,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 15:59:53,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 15:59:53,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 15:59:53,916 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-13 15:59:53,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 15:59:53,963 INFO L93 Difference]: Finished difference Result 132 states and 169 transitions. [2024-10-13 15:59:53,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 15:59:53,964 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-13 15:59:53,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 15:59:53,965 INFO L225 Difference]: With dead ends: 132 [2024-10-13 15:59:53,965 INFO L226 Difference]: Without dead ends: 66 [2024-10-13 15:59:53,966 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-13 15:59:53,967 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-13 15:59:53,968 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-13 15:59:53,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-13 15:59:53,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-10-13 15:59:53,976 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-13 15:59:53,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 84 transitions. [2024-10-13 15:59:53,977 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 84 transitions. Word has length 19 [2024-10-13 15:59:53,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 15:59:53,978 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 84 transitions. [2024-10-13 15:59:53,978 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-13 15:59:53,978 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 84 transitions. [2024-10-13 15:59:53,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-13 15:59:53,979 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 15:59:53,979 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-13 15:59:53,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 15:59:53,980 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-13 15:59:53,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 15:59:53,981 INFO L85 PathProgramCache]: Analyzing trace with hash -447765931, now seen corresponding path program 1 times [2024-10-13 15:59:53,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 15:59:53,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921508573] [2024-10-13 15:59:53,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 15:59:53,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 15:59:54,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:54,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 15:59:54,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:54,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 15:59:54,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:54,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 15:59:54,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:54,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 15:59:54,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:54,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 15:59:54,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:54,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 15:59:54,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:54,118 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-13 15:59:54,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 15:59:54,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921508573] [2024-10-13 15:59:54,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921508573] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 15:59:54,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 15:59:54,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 15:59:54,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464282637] [2024-10-13 15:59:54,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 15:59:54,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 15:59:54,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 15:59:54,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 15:59:54,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 15:59:54,121 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-13 15:59:54,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 15:59:54,157 INFO L93 Difference]: Finished difference Result 118 states and 148 transitions. [2024-10-13 15:59:54,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 15:59:54,158 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-13 15:59:54,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 15:59:54,159 INFO L225 Difference]: With dead ends: 118 [2024-10-13 15:59:54,160 INFO L226 Difference]: Without dead ends: 64 [2024-10-13 15:59:54,160 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-13 15:59:54,161 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-13 15:59:54,162 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-13 15:59:54,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-13 15:59:54,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-10-13 15:59:54,169 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-13 15:59:54,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 80 transitions. [2024-10-13 15:59:54,170 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 80 transitions. Word has length 36 [2024-10-13 15:59:54,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 15:59:54,171 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 80 transitions. [2024-10-13 15:59:54,171 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-13 15:59:54,171 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 80 transitions. [2024-10-13 15:59:54,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-13 15:59:54,173 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 15:59:54,173 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-13 15:59:54,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 15:59:54,174 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-13 15:59:54,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 15:59:54,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1249086082, now seen corresponding path program 1 times [2024-10-13 15:59:54,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 15:59:54,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971065975] [2024-10-13 15:59:54,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 15:59:54,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 15:59:54,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:54,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 15:59:54,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:54,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 15:59:54,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:54,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 15:59:54,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:54,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 15:59:54,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:54,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 15:59:54,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:54,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 15:59:54,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:54,248 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-13 15:59:54,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 15:59:54,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971065975] [2024-10-13 15:59:54,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971065975] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 15:59:54,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 15:59:54,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 15:59:54,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871265127] [2024-10-13 15:59:54,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 15:59:54,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 15:59:54,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 15:59:54,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 15:59:54,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 15:59:54,251 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-13 15:59:54,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 15:59:54,278 INFO L93 Difference]: Finished difference Result 111 states and 136 transitions. [2024-10-13 15:59:54,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 15:59:54,279 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-13 15:59:54,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 15:59:54,280 INFO L225 Difference]: With dead ends: 111 [2024-10-13 15:59:54,280 INFO L226 Difference]: Without dead ends: 69 [2024-10-13 15:59:54,280 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-13 15:59:54,281 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-13 15:59:54,282 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-13 15:59:54,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-10-13 15:59:54,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2024-10-13 15:59:54,288 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-13 15:59:54,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 86 transitions. [2024-10-13 15:59:54,289 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 86 transitions. Word has length 37 [2024-10-13 15:59:54,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 15:59:54,290 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 86 transitions. [2024-10-13 15:59:54,290 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-13 15:59:54,290 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 86 transitions. [2024-10-13 15:59:54,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-13 15:59:54,291 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 15:59:54,291 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-13 15:59:54,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 15:59:54,292 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-13 15:59:54,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 15:59:54,292 INFO L85 PathProgramCache]: Analyzing trace with hash -2058432708, now seen corresponding path program 1 times [2024-10-13 15:59:54,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 15:59:54,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916713877] [2024-10-13 15:59:54,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 15:59:54,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 15:59:54,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:54,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 15:59:54,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:54,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 15:59:54,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:54,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 15:59:54,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:54,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 15:59:54,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:54,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 15:59:54,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:54,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 15:59:54,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:54,390 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-13 15:59:54,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 15:59:54,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916713877] [2024-10-13 15:59:54,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916713877] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 15:59:54,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [798876955] [2024-10-13 15:59:54,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 15:59:54,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 15:59:54,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 15:59:54,394 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 15:59:54,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 15:59:54,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:54,493 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 15:59:54,498 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 15:59:54,553 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-13 15:59:54,555 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 15:59:54,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [798876955] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 15:59:54,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 15:59:54,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-10-13 15:59:54,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861981472] [2024-10-13 15:59:54,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 15:59:54,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 15:59:54,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 15:59:54,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 15:59:54,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 15:59:54,560 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-13 15:59:54,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 15:59:54,593 INFO L93 Difference]: Finished difference Result 106 states and 130 transitions. [2024-10-13 15:59:54,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 15:59:54,594 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-13 15:59:54,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 15:59:54,595 INFO L225 Difference]: With dead ends: 106 [2024-10-13 15:59:54,595 INFO L226 Difference]: Without dead ends: 58 [2024-10-13 15:59:54,595 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-13 15:59:54,596 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-13 15:59:54,597 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-13 15:59:54,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-10-13 15:59:54,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-10-13 15:59:54,602 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-13 15:59:54,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 71 transitions. [2024-10-13 15:59:54,603 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 71 transitions. Word has length 37 [2024-10-13 15:59:54,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 15:59:54,604 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 71 transitions. [2024-10-13 15:59:54,604 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-13 15:59:54,604 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 71 transitions. [2024-10-13 15:59:54,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-13 15:59:54,605 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 15:59:54,605 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-13 15:59:54,623 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 15:59:54,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 15:59:54,806 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-13 15:59:54,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 15:59:54,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1531266017, now seen corresponding path program 1 times [2024-10-13 15:59:54,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 15:59:54,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328759135] [2024-10-13 15:59:54,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 15:59:54,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 15:59:54,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:54,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 15:59:54,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:54,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 15:59:54,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:54,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 15:59:54,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:54,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 15:59:54,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:54,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 15:59:54,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:54,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 15:59:54,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:54,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 15:59:54,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:54,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 15:59:54,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:54,928 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-13 15:59:54,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 15:59:54,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328759135] [2024-10-13 15:59:54,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328759135] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 15:59:54,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1768971711] [2024-10-13 15:59:54,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 15:59:54,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 15:59:54,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 15:59:54,938 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 15:59:54,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 15:59:55,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:55,029 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 15:59:55,031 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 15:59:55,059 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-13 15:59:55,063 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 15:59:55,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1768971711] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 15:59:55,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 15:59:55,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-10-13 15:59:55,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903647619] [2024-10-13 15:59:55,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 15:59:55,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 15:59:55,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 15:59:55,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 15:59:55,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 15:59:55,065 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-13 15:59:55,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 15:59:55,106 INFO L93 Difference]: Finished difference Result 94 states and 112 transitions. [2024-10-13 15:59:55,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 15:59:55,107 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-13 15:59:55,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 15:59:55,108 INFO L225 Difference]: With dead ends: 94 [2024-10-13 15:59:55,110 INFO L226 Difference]: Without dead ends: 58 [2024-10-13 15:59:55,111 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-13 15:59:55,112 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-13 15:59:55,112 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-13 15:59:55,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-10-13 15:59:55,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-10-13 15:59:55,125 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-13 15:59:55,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 70 transitions. [2024-10-13 15:59:55,128 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 70 transitions. Word has length 47 [2024-10-13 15:59:55,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 15:59:55,130 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 70 transitions. [2024-10-13 15:59:55,130 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-13 15:59:55,130 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 70 transitions. [2024-10-13 15:59:55,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-13 15:59:55,132 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 15:59:55,132 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-13 15:59:55,145 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-13 15:59:55,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-13 15:59:55,334 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-13 15:59:55,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 15:59:55,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1448533612, now seen corresponding path program 1 times [2024-10-13 15:59:55,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 15:59:55,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253365877] [2024-10-13 15:59:55,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 15:59:55,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 15:59:55,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:55,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 15:59:55,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:55,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 15:59:55,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:55,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 15:59:55,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:55,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 15:59:55,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:55,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 15:59:55,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:55,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 15:59:55,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:55,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 15:59:55,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:55,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-13 15:59:55,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:55,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-13 15:59:55,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:55,415 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-13 15:59:55,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 15:59:55,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253365877] [2024-10-13 15:59:55,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253365877] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 15:59:55,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 15:59:55,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 15:59:55,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018239379] [2024-10-13 15:59:55,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 15:59:55,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 15:59:55,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 15:59:55,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 15:59:55,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 15:59:55,418 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-13 15:59:55,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 15:59:55,447 INFO L93 Difference]: Finished difference Result 59 states and 71 transitions. [2024-10-13 15:59:55,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 15:59:55,447 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-13 15:59:55,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 15:59:55,448 INFO L225 Difference]: With dead ends: 59 [2024-10-13 15:59:55,448 INFO L226 Difference]: Without dead ends: 58 [2024-10-13 15:59:55,449 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-13 15:59:55,449 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-13 15:59:55,450 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-13 15:59:55,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-10-13 15:59:55,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2024-10-13 15:59:55,455 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-13 15:59:55,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 69 transitions. [2024-10-13 15:59:55,456 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 69 transitions. Word has length 54 [2024-10-13 15:59:55,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 15:59:55,456 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 69 transitions. [2024-10-13 15:59:55,457 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-13 15:59:55,457 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2024-10-13 15:59:55,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-13 15:59:55,458 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 15:59:55,458 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-13 15:59:55,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 15:59:55,458 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-13 15:59:55,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 15:59:55,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1954868884, now seen corresponding path program 1 times [2024-10-13 15:59:55,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 15:59:55,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128956210] [2024-10-13 15:59:55,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 15:59:55,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 15:59:55,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:55,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 15:59:55,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:55,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 15:59:55,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:55,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 15:59:55,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:55,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 15:59:55,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:55,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 15:59:55,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:55,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 15:59:55,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:55,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 15:59:55,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:55,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-13 15:59:55,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:55,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-13 15:59:55,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:55,551 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-13 15:59:55,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 15:59:55,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128956210] [2024-10-13 15:59:55,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128956210] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 15:59:55,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 15:59:55,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 15:59:55,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956745393] [2024-10-13 15:59:55,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 15:59:55,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 15:59:55,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 15:59:55,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 15:59:55,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 15:59:55,555 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-13 15:59:55,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 15:59:55,583 INFO L93 Difference]: Finished difference Result 64 states and 78 transitions. [2024-10-13 15:59:55,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 15:59:55,584 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-13 15:59:55,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 15:59:55,585 INFO L225 Difference]: With dead ends: 64 [2024-10-13 15:59:55,586 INFO L226 Difference]: Without dead ends: 63 [2024-10-13 15:59:55,586 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-13 15:59:55,587 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-13 15:59:55,589 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-13 15:59:55,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-13 15:59:55,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2024-10-13 15:59:55,597 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-13 15:59:55,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 76 transitions. [2024-10-13 15:59:55,600 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 76 transitions. Word has length 55 [2024-10-13 15:59:55,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 15:59:55,600 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 76 transitions. [2024-10-13 15:59:55,600 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-13 15:59:55,601 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 76 transitions. [2024-10-13 15:59:55,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-13 15:59:55,602 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 15:59:55,602 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-13 15:59:55,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 15:59:55,602 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-13 15:59:55,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 15:59:55,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1788598603, now seen corresponding path program 1 times [2024-10-13 15:59:55,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 15:59:55,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968881271] [2024-10-13 15:59:55,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 15:59:55,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 15:59:55,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:55,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 15:59:55,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:55,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 15:59:55,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:55,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 15:59:55,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:55,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 15:59:55,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:55,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 15:59:55,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:55,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 15:59:55,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:55,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 15:59:55,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:55,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-13 15:59:55,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:55,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-13 15:59:55,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:55,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-13 15:59:55,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:55,744 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-13 15:59:55,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 15:59:55,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968881271] [2024-10-13 15:59:55,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968881271] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 15:59:55,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 15:59:55,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 15:59:55,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258679450] [2024-10-13 15:59:55,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 15:59:55,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 15:59:55,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 15:59:55,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 15:59:55,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 15:59:55,747 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-13 15:59:55,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 15:59:55,769 INFO L93 Difference]: Finished difference Result 83 states and 98 transitions. [2024-10-13 15:59:55,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 15:59:55,770 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-13 15:59:55,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 15:59:55,771 INFO L225 Difference]: With dead ends: 83 [2024-10-13 15:59:55,771 INFO L226 Difference]: Without dead ends: 54 [2024-10-13 15:59:55,771 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-13 15:59:55,772 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-13 15:59:55,772 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-13 15:59:55,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-10-13 15:59:55,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-10-13 15:59:55,783 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-13 15:59:55,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2024-10-13 15:59:55,783 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 61 [2024-10-13 15:59:55,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 15:59:55,784 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2024-10-13 15:59:55,784 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-13 15:59:55,784 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2024-10-13 15:59:55,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-13 15:59:55,785 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 15:59:55,788 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-13 15:59:55,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 15:59:55,789 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-13 15:59:55,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 15:59:55,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1868968227, now seen corresponding path program 1 times [2024-10-13 15:59:55,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 15:59:55,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292322678] [2024-10-13 15:59:55,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 15:59:55,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 15:59:55,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:55,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 15:59:55,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:55,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 15:59:55,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:55,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 15:59:55,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:55,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 15:59:55,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:55,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 15:59:55,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:55,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 15:59:55,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:55,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 15:59:55,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:55,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-13 15:59:55,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:55,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-13 15:59:55,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:55,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-13 15:59:55,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:55,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 15:59:55,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:55,920 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-13 15:59:55,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 15:59:55,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292322678] [2024-10-13 15:59:55,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292322678] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 15:59:55,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1117907950] [2024-10-13 15:59:55,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 15:59:55,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 15:59:55,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 15:59:55,923 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 15:59:55,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-13 15:59:56,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:56,010 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 15:59:56,012 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 15:59:56,040 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-13 15:59:56,040 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 15:59:56,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1117907950] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 15:59:56,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 15:59:56,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-10-13 15:59:56,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93760186] [2024-10-13 15:59:56,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 15:59:56,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 15:59:56,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 15:59:56,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 15:59:56,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 15:59:56,044 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-13 15:59:56,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 15:59:56,066 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2024-10-13 15:59:56,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 15:59:56,067 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-13 15:59:56,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 15:59:56,068 INFO L225 Difference]: With dead ends: 67 [2024-10-13 15:59:56,068 INFO L226 Difference]: Without dead ends: 54 [2024-10-13 15:59:56,069 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-13 15:59:56,069 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-13 15:59:56,069 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-13 15:59:56,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-10-13 15:59:56,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-10-13 15:59:56,074 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-13 15:59:56,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2024-10-13 15:59:56,075 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 65 [2024-10-13 15:59:56,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 15:59:56,075 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2024-10-13 15:59:56,075 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-13 15:59:56,076 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2024-10-13 15:59:56,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-13 15:59:56,078 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 15:59:56,078 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-13 15:59:56,095 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-13 15:59:56,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 15:59:56,279 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-13 15:59:56,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 15:59:56,280 INFO L85 PathProgramCache]: Analyzing trace with hash 562358274, now seen corresponding path program 1 times [2024-10-13 15:59:56,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 15:59:56,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528663181] [2024-10-13 15:59:56,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 15:59:56,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 15:59:56,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:56,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 15:59:56,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:56,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 15:59:56,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:56,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 15:59:56,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:56,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 15:59:56,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:56,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 15:59:56,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:56,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 15:59:56,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:56,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 15:59:56,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:56,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-13 15:59:56,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:56,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-13 15:59:56,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:56,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-13 15:59:56,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:56,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-13 15:59:56,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:56,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 15:59:56,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:56,389 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-13 15:59:56,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 15:59:56,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528663181] [2024-10-13 15:59:56,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528663181] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 15:59:56,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 15:59:56,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 15:59:56,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261301381] [2024-10-13 15:59:56,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 15:59:56,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 15:59:56,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 15:59:56,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 15:59:56,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 15:59:56,391 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-13 15:59:56,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 15:59:56,420 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2024-10-13 15:59:56,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 15:59:56,421 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-13 15:59:56,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 15:59:56,422 INFO L225 Difference]: With dead ends: 54 [2024-10-13 15:59:56,422 INFO L226 Difference]: Without dead ends: 53 [2024-10-13 15:59:56,422 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-13 15:59:56,423 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-13 15:59:56,423 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-13 15:59:56,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-10-13 15:59:56,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-10-13 15:59:56,432 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-13 15:59:56,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2024-10-13 15:59:56,433 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 62 transitions. Word has length 71 [2024-10-13 15:59:56,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 15:59:56,433 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 62 transitions. [2024-10-13 15:59:56,433 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-13 15:59:56,434 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2024-10-13 15:59:56,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-13 15:59:56,434 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 15:59:56,434 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-13 15:59:56,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 15:59:56,435 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-13 15:59:56,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 15:59:56,435 INFO L85 PathProgramCache]: Analyzing trace with hash 253237461, now seen corresponding path program 1 times [2024-10-13 15:59:56,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 15:59:56,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194263017] [2024-10-13 15:59:56,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 15:59:56,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 15:59:56,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:56,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 15:59:56,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:56,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 15:59:56,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:56,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 15:59:56,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:56,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 15:59:56,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:56,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 15:59:56,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:56,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 15:59:56,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:56,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 15:59:56,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:56,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-13 15:59:56,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:56,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-13 15:59:56,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:56,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-13 15:59:56,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:56,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-13 15:59:56,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:56,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 15:59:56,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:56,546 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-13 15:59:56,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 15:59:56,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194263017] [2024-10-13 15:59:56,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194263017] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 15:59:56,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 15:59:56,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 15:59:56,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623314928] [2024-10-13 15:59:56,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 15:59:56,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 15:59:56,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 15:59:56,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 15:59:56,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 15:59:56,553 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-13 15:59:56,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 15:59:56,575 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2024-10-13 15:59:56,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 15:59:56,576 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-13 15:59:56,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 15:59:56,577 INFO L225 Difference]: With dead ends: 59 [2024-10-13 15:59:56,577 INFO L226 Difference]: Without dead ends: 53 [2024-10-13 15:59:56,577 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-13 15:59:56,578 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-13 15:59:56,578 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-13 15:59:56,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-10-13 15:59:56,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-10-13 15:59:56,585 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-13 15:59:56,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2024-10-13 15:59:56,586 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 72 [2024-10-13 15:59:56,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 15:59:56,587 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2024-10-13 15:59:56,587 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-13 15:59:56,587 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2024-10-13 15:59:56,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-13 15:59:56,588 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 15:59:56,588 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-13 15:59:56,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 15:59:56,588 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-13 15:59:56,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 15:59:56,589 INFO L85 PathProgramCache]: Analyzing trace with hash -556109165, now seen corresponding path program 1 times [2024-10-13 15:59:56,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 15:59:56,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119466220] [2024-10-13 15:59:56,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 15:59:56,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 15:59:56,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:56,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 15:59:56,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:56,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 15:59:56,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:56,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 15:59:56,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:56,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 15:59:56,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:56,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 15:59:56,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:56,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 15:59:56,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:56,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 15:59:56,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:56,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-13 15:59:56,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:56,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-13 15:59:56,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:56,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-13 15:59:56,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:56,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-13 15:59:56,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:56,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 15:59:56,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:56,708 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-13 15:59:56,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 15:59:56,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119466220] [2024-10-13 15:59:56,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119466220] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 15:59:56,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1557235131] [2024-10-13 15:59:56,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 15:59:56,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 15:59:56,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 15:59:56,711 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 15:59:56,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-13 15:59:56,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:56,800 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 15:59:56,802 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 15:59:56,821 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-13 15:59:56,821 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 15:59:56,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1557235131] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 15:59:56,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 15:59:56,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-10-13 15:59:56,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748404920] [2024-10-13 15:59:56,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 15:59:56,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 15:59:56,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 15:59:56,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 15:59:56,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 15:59:56,823 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-13 15:59:56,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 15:59:56,838 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2024-10-13 15:59:56,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 15:59:56,838 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-13 15:59:56,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 15:59:56,839 INFO L225 Difference]: With dead ends: 55 [2024-10-13 15:59:56,839 INFO L226 Difference]: Without dead ends: 0 [2024-10-13 15:59:56,839 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-13 15:59:56,840 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-13 15:59:56,840 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-13 15:59:56,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-13 15:59:56,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-13 15:59:56,841 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-13 15:59:56,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-13 15:59:56,841 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 72 [2024-10-13 15:59:56,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 15:59:56,841 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 15:59:56,841 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-13 15:59:56,842 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-13 15:59:56,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-13 15:59:56,844 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2024-10-13 15:59:56,845 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2024-10-13 15:59:56,845 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2024-10-13 15:59:56,846 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2024-10-13 15:59:56,846 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2024-10-13 15:59:56,846 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2024-10-13 15:59:56,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2024-10-13 15:59:56,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2024-10-13 15:59:56,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-13 15:59:57,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 15:59:57,050 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 15:59:57,052 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-13 15:59:57,100 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 15:59:57,117 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 03:59:57 BoogieIcfgContainer [2024-10-13 15:59:57,117 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 15:59:57,117 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 15:59:57,117 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 15:59:57,118 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 15:59:57,118 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:59:53" (3/4) ... [2024-10-13 15:59:57,121 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 15:59:57,125 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2024-10-13 15:59:57,125 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure staticReturnsFalse [2024-10-13 15:59:57,125 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2024-10-13 15:59:57,125 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure staticReturnsTrue [2024-10-13 15:59:57,130 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2024-10-13 15:59:57,131 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2024-10-13 15:59:57,131 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-13 15:59:57,132 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-13 15:59:57,232 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 15:59:57,232 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-13 15:59:57,232 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 15:59:57,235 INFO L158 Benchmark]: Toolchain (without parser) took 6164.06ms. Allocated memory was 182.5MB in the beginning and 220.2MB in the end (delta: 37.7MB). Free memory was 147.1MB in the beginning and 125.4MB in the end (delta: 21.7MB). Peak memory consumption was 60.1MB. Max. memory is 16.1GB. [2024-10-13 15:59:57,236 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 121.6MB. Free memory is still 83.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 15:59:57,236 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1359.16ms. Allocated memory is still 182.5MB. Free memory was 147.1MB in the beginning and 80.6MB in the end (delta: 66.5MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2024-10-13 15:59:57,236 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.16ms. Allocated memory is still 182.5MB. Free memory was 80.6MB in the beginning and 77.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 15:59:57,236 INFO L158 Benchmark]: Boogie Preprocessor took 65.16ms. Allocated memory is still 182.5MB. Free memory was 77.4MB in the beginning and 74.3MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 15:59:57,237 INFO L158 Benchmark]: RCFGBuilder took 453.02ms. Allocated memory is still 182.5MB. Free memory was 74.3MB in the beginning and 55.4MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-13 15:59:57,237 INFO L158 Benchmark]: TraceAbstraction took 4078.93ms. Allocated memory was 182.5MB in the beginning and 220.2MB in the end (delta: 37.7MB). Free memory was 54.4MB in the beginning and 131.7MB in the end (delta: -77.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 15:59:57,237 INFO L158 Benchmark]: Witness Printer took 115.11ms. Allocated memory is still 220.2MB. Free memory was 131.7MB in the beginning and 125.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 15:59:57,239 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.17ms. Allocated memory is still 121.6MB. Free memory is still 83.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1359.16ms. Allocated memory is still 182.5MB. Free memory was 147.1MB in the beginning and 80.6MB in the end (delta: 66.5MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 81.16ms. Allocated memory is still 182.5MB. Free memory was 80.6MB in the beginning and 77.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.16ms. Allocated memory is still 182.5MB. Free memory was 77.4MB in the beginning and 74.3MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 453.02ms. Allocated memory is still 182.5MB. Free memory was 74.3MB in the beginning and 55.4MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 4078.93ms. Allocated memory was 182.5MB in the beginning and 220.2MB in the end (delta: 37.7MB). Free memory was 54.4MB in the beginning and 131.7MB in the end (delta: -77.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 115.11ms. Allocated memory is still 220.2MB. Free memory was 131.7MB in the beginning and 125.4MB 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: 1572]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1572]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1594]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1594]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1619]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1619]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1636]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1636]: 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.9s, 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: 1552]: Procedure Contract for staticReturnsFalse Derived contract for procedure staticReturnsFalse. Ensures: (\result == 0) - ProcedureContractResult [Line: 1548]: Procedure Contract for staticReturnsTrue Derived contract for procedure staticReturnsTrue. Ensures: (\result == 1) RESULT: Ultimate proved your program to be correct! [2024-10-13 15:59:57,266 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE