./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/CWE190_Integer_Overflow__int_fscanf_multiply_09_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_multiply_09_good.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash bd8da2a5b1f5bfeea6b498b97e1d52c51000c2f6d2080d1291b947e8ad7dc39c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 22:09:56,889 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 22:09:56,961 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-10-11 22:09:56,965 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 22:09:56,966 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 22:09:56,996 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 22:09:56,998 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 22:09:56,999 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 22:09:56,999 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 22:09:56,999 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 22:09:57,000 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 22:09:57,000 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 22:09:57,001 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 22:09:57,001 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 22:09:57,002 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 22:09:57,002 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 22:09:57,003 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 22:09:57,003 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 22:09:57,004 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 22:09:57,004 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 22:09:57,004 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 22:09:57,005 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 22:09:57,005 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 22:09:57,005 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 22:09:57,009 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 22:09:57,009 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 22:09:57,010 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 22:09:57,010 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 22:09:57,010 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 22:09:57,011 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 22:09:57,011 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 22:09:57,011 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 22:09:57,011 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 22:09:57,012 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 22:09:57,012 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 22:09:57,012 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 22:09:57,012 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 22:09:57,013 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 22:09:57,013 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 22:09:57,017 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 22:09:57,017 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 22:09:57,017 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bd8da2a5b1f5bfeea6b498b97e1d52c51000c2f6d2080d1291b947e8ad7dc39c [2024-10-11 22:09:57,298 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 22:09:57,323 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 22:09:57,326 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 22:09:57,327 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 22:09:57,327 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 22:09:57,328 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_multiply_09_good.i [2024-10-11 22:09:58,721 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 22:09:59,042 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 22:09:59,043 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_multiply_09_good.i [2024-10-11 22:09:59,066 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ed9ef7f00/0ab5e71fd2a84bef83c0e41935847f9c/FLAG0b23dbee9 [2024-10-11 22:09:59,081 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ed9ef7f00/0ab5e71fd2a84bef83c0e41935847f9c [2024-10-11 22:09:59,084 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 22:09:59,087 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 22:09:59,088 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 22:09:59,089 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 22:09:59,094 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 22:09:59,094 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:09:59" (1/1) ... [2024-10-11 22:09:59,097 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dc8e035 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:09:59, skipping insertion in model container [2024-10-11 22:09:59,097 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:09:59" (1/1) ... [2024-10-11 22:09:59,160 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 22:09:59,823 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 22:09:59,834 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 22:09:59,912 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 22:10:00,031 INFO L204 MainTranslator]: Completed translation [2024-10-11 22:10:00,032 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:10:00 WrapperNode [2024-10-11 22:10:00,032 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 22:10:00,033 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 22:10:00,033 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 22:10:00,033 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 22:10:00,040 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:10:00" (1/1) ... [2024-10-11 22:10:00,071 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:10:00" (1/1) ... [2024-10-11 22:10:00,105 INFO L138 Inliner]: procedures = 501, calls = 38, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 101 [2024-10-11 22:10:00,105 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 22:10:00,106 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 22:10:00,106 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 22:10:00,106 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 22:10:00,120 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:10:00" (1/1) ... [2024-10-11 22:10:00,121 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:10:00" (1/1) ... [2024-10-11 22:10:00,124 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:10:00" (1/1) ... [2024-10-11 22:10:00,147 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-11 22:10:00,147 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:10:00" (1/1) ... [2024-10-11 22:10:00,147 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:10:00" (1/1) ... [2024-10-11 22:10:00,155 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:10:00" (1/1) ... [2024-10-11 22:10:00,160 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:10:00" (1/1) ... [2024-10-11 22:10:00,162 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:10:00" (1/1) ... [2024-10-11 22:10:00,163 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:10:00" (1/1) ... [2024-10-11 22:10:00,169 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 22:10:00,170 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 22:10:00,174 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 22:10:00,174 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 22:10:00,175 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:10:00" (1/1) ... [2024-10-11 22:10:00,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 22:10:00,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 22:10:00,212 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 22:10:00,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 22:10:00,278 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2024-10-11 22:10:00,279 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2024-10-11 22:10:00,279 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-10-11 22:10:00,283 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-10-11 22:10:00,283 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 22:10:00,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 22:10:00,291 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 22:10:00,436 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 22:10:00,438 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 22:10:00,619 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2024-10-11 22:10:00,620 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 22:10:00,660 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 22:10:00,660 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 22:10:00,661 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:10:00 BoogieIcfgContainer [2024-10-11 22:10:00,661 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 22:10:00,662 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 22:10:00,664 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 22:10:00,667 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 22:10:00,667 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 10:09:59" (1/3) ... [2024-10-11 22:10:00,668 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b02691 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:10:00, skipping insertion in model container [2024-10-11 22:10:00,668 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:10:00" (2/3) ... [2024-10-11 22:10:00,669 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b02691 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:10:00, skipping insertion in model container [2024-10-11 22:10:00,669 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:10:00" (3/3) ... [2024-10-11 22:10:00,671 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fscanf_multiply_09_good.i [2024-10-11 22:10:00,687 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 22:10:00,687 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-10-11 22:10:00,742 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 22:10:00,749 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;@79913b17, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 22:10:00,750 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-10-11 22:10:00,754 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 41 states have (on average 1.5609756097560976) internal successors, (64), 49 states have internal predecessors, (64), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-11 22:10:00,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-11 22:10:00,762 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:10:00,765 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:10:00,766 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 22:10:00,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:10:00,772 INFO L85 PathProgramCache]: Analyzing trace with hash -360474310, now seen corresponding path program 1 times [2024-10-11 22:10:00,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:10:00,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142296399] [2024-10-11 22:10:00,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:10:00,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:10:00,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:10:01,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:10:01,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:10:01,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 22:10:01,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:10:01,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142296399] [2024-10-11 22:10:01,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142296399] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:10:01,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:10:01,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 22:10:01,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122626325] [2024-10-11 22:10:01,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:10:01,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 22:10:01,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:10:01,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 22:10:01,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 22:10:01,138 INFO L87 Difference]: Start difference. First operand has 62 states, 41 states have (on average 1.5609756097560976) internal successors, (64), 49 states have internal predecessors, (64), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 22:10:01,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:10:01,199 INFO L93 Difference]: Finished difference Result 62 states and 84 transitions. [2024-10-11 22:10:01,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 22:10:01,201 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-10-11 22:10:01,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:10:01,208 INFO L225 Difference]: With dead ends: 62 [2024-10-11 22:10:01,208 INFO L226 Difference]: Without dead ends: 55 [2024-10-11 22:10:01,211 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 22:10:01,216 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 1 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:10:01,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 143 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:10:01,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-11 22:10:01,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-10-11 22:10:01,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 38 states have (on average 1.5) internal successors, (57), 44 states have internal predecessors, (57), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 22:10:01,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 73 transitions. [2024-10-11 22:10:01,262 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 73 transitions. Word has length 12 [2024-10-11 22:10:01,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:10:01,264 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 73 transitions. [2024-10-11 22:10:01,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 22:10:01,265 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 73 transitions. [2024-10-11 22:10:01,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 22:10:01,266 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:10:01,267 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:10:01,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 22:10:01,267 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 22:10:01,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:10:01,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1710198345, now seen corresponding path program 1 times [2024-10-11 22:10:01,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:10:01,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550161695] [2024-10-11 22:10:01,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:10:01,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:10:01,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:10:01,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:10:01,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:10:01,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 22:10:01,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:10:01,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550161695] [2024-10-11 22:10:01,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550161695] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:10:01,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:10:01,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 22:10:01,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677601011] [2024-10-11 22:10:01,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:10:01,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 22:10:01,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:10:01,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 22:10:01,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 22:10:01,378 INFO L87 Difference]: Start difference. First operand 55 states and 73 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 22:10:01,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:10:01,426 INFO L93 Difference]: Finished difference Result 102 states and 135 transitions. [2024-10-11 22:10:01,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 22:10:01,427 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-10-11 22:10:01,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:10:01,428 INFO L225 Difference]: With dead ends: 102 [2024-10-11 22:10:01,428 INFO L226 Difference]: Without dead ends: 60 [2024-10-11 22:10:01,429 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 22:10:01,430 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 5 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:10:01,430 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 133 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:10:01,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-10-11 22:10:01,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2024-10-11 22:10:01,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 41 states have (on average 1.4878048780487805) internal successors, (61), 46 states have internal predecessors, (61), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 22:10:01,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 77 transitions. [2024-10-11 22:10:01,444 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 77 transitions. Word has length 13 [2024-10-11 22:10:01,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:10:01,444 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 77 transitions. [2024-10-11 22:10:01,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 22:10:01,444 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 77 transitions. [2024-10-11 22:10:01,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 22:10:01,445 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:10:01,445 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:10:01,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 22:10:01,446 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 22:10:01,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:10:01,446 INFO L85 PathProgramCache]: Analyzing trace with hash -918080656, now seen corresponding path program 1 times [2024-10-11 22:10:01,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:10:01,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680297714] [2024-10-11 22:10:01,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:10:01,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:10:01,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:10:01,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:10:01,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:10:01,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 22:10:01,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:10:01,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680297714] [2024-10-11 22:10:01,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680297714] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:10:01,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:10:01,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 22:10:01,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416380176] [2024-10-11 22:10:01,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:10:01,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 22:10:01,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:10:01,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 22:10:01,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 22:10:01,546 INFO L87 Difference]: Start difference. First operand 57 states and 77 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 22:10:01,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:10:01,579 INFO L93 Difference]: Finished difference Result 57 states and 77 transitions. [2024-10-11 22:10:01,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 22:10:01,580 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-10-11 22:10:01,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:10:01,583 INFO L225 Difference]: With dead ends: 57 [2024-10-11 22:10:01,583 INFO L226 Difference]: Without dead ends: 56 [2024-10-11 22:10:01,583 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 22:10:01,584 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 1 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:10:01,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 123 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:10:01,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-11 22:10:01,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-10-11 22:10:01,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 41 states have (on average 1.4634146341463414) internal successors, (60), 45 states have internal predecessors, (60), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 22:10:01,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 76 transitions. [2024-10-11 22:10:01,595 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 76 transitions. Word has length 16 [2024-10-11 22:10:01,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:10:01,595 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 76 transitions. [2024-10-11 22:10:01,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 22:10:01,596 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 76 transitions. [2024-10-11 22:10:01,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 22:10:01,597 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:10:01,597 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:10:01,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 22:10:01,597 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 22:10:01,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:10:01,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1604270833, now seen corresponding path program 1 times [2024-10-11 22:10:01,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:10:01,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96707285] [2024-10-11 22:10:01,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:10:01,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:10:01,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:10:01,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:10:01,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:10:01,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 22:10:01,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:10:01,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96707285] [2024-10-11 22:10:01,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96707285] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:10:01,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:10:01,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 22:10:01,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254925079] [2024-10-11 22:10:01,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:10:01,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 22:10:01,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:10:01,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 22:10:01,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 22:10:01,658 INFO L87 Difference]: Start difference. First operand 56 states and 76 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 22:10:01,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:10:01,691 INFO L93 Difference]: Finished difference Result 88 states and 116 transitions. [2024-10-11 22:10:01,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 22:10:01,692 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-10-11 22:10:01,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:10:01,693 INFO L225 Difference]: With dead ends: 88 [2024-10-11 22:10:01,693 INFO L226 Difference]: Without dead ends: 59 [2024-10-11 22:10:01,694 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 22:10:01,695 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 4 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:10:01,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 127 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:10:01,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-10-11 22:10:01,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2024-10-11 22:10:01,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 44 states have (on average 1.4545454545454546) internal successors, (64), 47 states have internal predecessors, (64), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 22:10:01,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 80 transitions. [2024-10-11 22:10:01,708 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 80 transitions. Word has length 17 [2024-10-11 22:10:01,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:10:01,708 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 80 transitions. [2024-10-11 22:10:01,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 22:10:01,708 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 80 transitions. [2024-10-11 22:10:01,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 22:10:01,709 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:10:01,713 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:10:01,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 22:10:01,714 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 22:10:01,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:10:01,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1157204749, now seen corresponding path program 1 times [2024-10-11 22:10:01,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:10:01,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464117917] [2024-10-11 22:10:01,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:10:01,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:10:01,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:10:01,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:10:01,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:10:01,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 22:10:01,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:10:01,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464117917] [2024-10-11 22:10:01,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464117917] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:10:01,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:10:01,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 22:10:01,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558061346] [2024-10-11 22:10:01,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:10:01,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 22:10:01,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:10:01,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 22:10:01,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 22:10:01,770 INFO L87 Difference]: Start difference. First operand 58 states and 80 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 22:10:01,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:10:01,801 INFO L93 Difference]: Finished difference Result 101 states and 135 transitions. [2024-10-11 22:10:01,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 22:10:01,802 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-10-11 22:10:01,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:10:01,803 INFO L225 Difference]: With dead ends: 101 [2024-10-11 22:10:01,803 INFO L226 Difference]: Without dead ends: 52 [2024-10-11 22:10:01,803 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 22:10:01,804 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 59 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:10:01,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 57 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:10:01,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-11 22:10:01,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-10-11 22:10:01,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 41 states have internal predecessors, (49), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 22:10:01,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 65 transitions. [2024-10-11 22:10:01,830 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 65 transitions. Word has length 18 [2024-10-11 22:10:01,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:10:01,830 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 65 transitions. [2024-10-11 22:10:01,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 22:10:01,831 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 65 transitions. [2024-10-11 22:10:01,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 22:10:01,833 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:10:01,833 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:10:01,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 22:10:01,833 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 22:10:01,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:10:01,834 INFO L85 PathProgramCache]: Analyzing trace with hash 286414263, now seen corresponding path program 1 times [2024-10-11 22:10:01,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:10:01,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715582842] [2024-10-11 22:10:01,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:10:01,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:10:01,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:10:01,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:10:01,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:10:01,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 22:10:01,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:10:01,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715582842] [2024-10-11 22:10:01,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715582842] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:10:01,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:10:01,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 22:10:01,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305299651] [2024-10-11 22:10:01,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:10:01,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 22:10:01,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:10:01,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 22:10:01,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 22:10:01,913 INFO L87 Difference]: Start difference. First operand 52 states and 65 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 22:10:01,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:10:01,949 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2024-10-11 22:10:01,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 22:10:01,953 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2024-10-11 22:10:01,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:10:01,955 INFO L225 Difference]: With dead ends: 66 [2024-10-11 22:10:01,956 INFO L226 Difference]: Without dead ends: 56 [2024-10-11 22:10:01,956 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 22:10:01,957 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 1 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:10:01,958 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 114 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:10:01,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-11 22:10:01,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-10-11 22:10:01,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 42 states have (on average 1.2619047619047619) internal successors, (53), 45 states have internal predecessors, (53), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 22:10:01,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 69 transitions. [2024-10-11 22:10:01,965 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 69 transitions. Word has length 19 [2024-10-11 22:10:01,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:10:01,968 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 69 transitions. [2024-10-11 22:10:01,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 22:10:01,968 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 69 transitions. [2024-10-11 22:10:01,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-11 22:10:01,969 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:10:01,969 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:10:01,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 22:10:01,969 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 22:10:01,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:10:01,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1856176396, now seen corresponding path program 1 times [2024-10-11 22:10:01,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:10:01,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584211058] [2024-10-11 22:10:01,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:10:01,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:10:01,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:10:02,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:10:02,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:10:02,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 22:10:02,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:10:02,022 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 22:10:02,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:10:02,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584211058] [2024-10-11 22:10:02,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584211058] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:10:02,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:10:02,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 22:10:02,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106098697] [2024-10-11 22:10:02,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:10:02,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 22:10:02,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:10:02,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 22:10:02,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 22:10:02,025 INFO L87 Difference]: Start difference. First operand 56 states and 69 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 22:10:02,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:10:02,037 INFO L93 Difference]: Finished difference Result 89 states and 106 transitions. [2024-10-11 22:10:02,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 22:10:02,041 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2024-10-11 22:10:02,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:10:02,042 INFO L225 Difference]: With dead ends: 89 [2024-10-11 22:10:02,042 INFO L226 Difference]: Without dead ends: 46 [2024-10-11 22:10:02,043 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 22:10:02,044 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 43 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:10:02,044 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 50 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:10:02,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-11 22:10:02,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-10-11 22:10:02,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 37 states have internal predecessors, (42), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 22:10:02,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2024-10-11 22:10:02,057 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 25 [2024-10-11 22:10:02,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:10:02,057 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2024-10-11 22:10:02,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 22:10:02,057 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2024-10-11 22:10:02,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-11 22:10:02,058 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:10:02,058 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:10:02,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 22:10:02,058 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 22:10:02,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:10:02,059 INFO L85 PathProgramCache]: Analyzing trace with hash -678726471, now seen corresponding path program 1 times [2024-10-11 22:10:02,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:10:02,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432013954] [2024-10-11 22:10:02,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:10:02,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:10:02,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:10:02,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:10:02,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:10:02,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 22:10:02,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:10:02,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 22:10:02,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:10:02,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432013954] [2024-10-11 22:10:02,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432013954] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:10:02,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:10:02,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 22:10:02,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799646145] [2024-10-11 22:10:02,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:10:02,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 22:10:02,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:10:02,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 22:10:02,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 22:10:02,131 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 22:10:02,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:10:02,144 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2024-10-11 22:10:02,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 22:10:02,145 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2024-10-11 22:10:02,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:10:02,146 INFO L225 Difference]: With dead ends: 46 [2024-10-11 22:10:02,146 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 22:10:02,146 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 22:10:02,148 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 1 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:10:02,148 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 93 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:10:02,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 22:10:02,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 22:10:02,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 22:10:02,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 22:10:02,151 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2024-10-11 22:10:02,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:10:02,152 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 22:10:02,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 22:10:02,152 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 22:10:02,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 22:10:02,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2024-10-11 22:10:02,157 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2024-10-11 22:10:02,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2024-10-11 22:10:02,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2024-10-11 22:10:02,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2024-10-11 22:10:02,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2024-10-11 22:10:02,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2024-10-11 22:10:02,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2024-10-11 22:10:02,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 22:10:02,166 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:10:02,168 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 22:10:02,253 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 22:10:02,267 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 10:10:02 BoogieIcfgContainer [2024-10-11 22:10:02,268 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 22:10:02,269 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 22:10:02,269 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 22:10:02,269 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 22:10:02,269 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:10:00" (3/4) ... [2024-10-11 22:10:02,272 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 22:10:02,275 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2024-10-11 22:10:02,275 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2024-10-11 22:10:02,279 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2024-10-11 22:10:02,279 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2024-10-11 22:10:02,280 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 22:10:02,280 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 22:10:02,369 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 22:10:02,369 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 22:10:02,369 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 22:10:02,370 INFO L158 Benchmark]: Toolchain (without parser) took 3282.77ms. Allocated memory is still 174.1MB. Free memory was 140.8MB in the beginning and 90.7MB in the end (delta: 50.1MB). Peak memory consumption was 49.3MB. Max. memory is 16.1GB. [2024-10-11 22:10:02,370 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 104.9MB. Free memory is still 75.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 22:10:02,370 INFO L158 Benchmark]: CACSL2BoogieTranslator took 943.81ms. Allocated memory is still 174.1MB. Free memory was 140.0MB in the beginning and 72.8MB in the end (delta: 67.1MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2024-10-11 22:10:02,370 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.35ms. Allocated memory is still 174.1MB. Free memory was 72.8MB in the beginning and 70.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 22:10:02,371 INFO L158 Benchmark]: Boogie Preprocessor took 63.65ms. Allocated memory is still 174.1MB. Free memory was 69.7MB in the beginning and 67.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 22:10:02,371 INFO L158 Benchmark]: RCFGBuilder took 490.74ms. Allocated memory is still 174.1MB. Free memory was 67.6MB in the beginning and 127.4MB in the end (delta: -59.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-11 22:10:02,371 INFO L158 Benchmark]: TraceAbstraction took 1605.48ms. Allocated memory is still 174.1MB. Free memory was 126.4MB in the beginning and 97.0MB in the end (delta: 29.4MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-10-11 22:10:02,372 INFO L158 Benchmark]: Witness Printer took 100.81ms. Allocated memory is still 174.1MB. Free memory was 97.0MB in the beginning and 90.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 22:10:02,373 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.18ms. Allocated memory is still 104.9MB. Free memory is still 75.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 943.81ms. Allocated memory is still 174.1MB. Free memory was 140.0MB in the beginning and 72.8MB in the end (delta: 67.1MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.35ms. Allocated memory is still 174.1MB. Free memory was 72.8MB in the beginning and 70.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.65ms. Allocated memory is still 174.1MB. Free memory was 69.7MB in the beginning and 67.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 490.74ms. Allocated memory is still 174.1MB. Free memory was 67.6MB in the beginning and 127.4MB in the end (delta: -59.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1605.48ms. Allocated memory is still 174.1MB. Free memory was 126.4MB in the beginning and 97.0MB in the end (delta: 29.4MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * Witness Printer took 100.81ms. Allocated memory is still 174.1MB. Free memory was 97.0MB in the beginning and 90.7MB 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: 1566]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1566]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1590]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1590]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1616]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1616]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1633]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1633]: 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 3 procedures, 62 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 8, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 116 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 115 mSDsluCounter, 840 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 346 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 104 IncrementalHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 494 mSDtfsCounter, 104 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=0, InterpolantAutomatonStates: 24, 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, 8 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 149 NumberOfCodeBlocks, 149 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 141 ConstructedInterpolants, 0 QuantifiedInterpolants, 206 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 4/4 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 RESULT: Ultimate proved your program to be correct! [2024-10-11 22:10:02,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE