./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted/RecursiveNonterminating-1.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/termination-crafted/RecursiveNonterminating-1.c', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/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) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '64bit', '--witnessprinter.graph.data.programhash', 'fc6cfc9bc139db752e72885619d5342f9725bf67cec8b7ca9da9022c75c17b44'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/termination-crafted/RecursiveNonterminating-1.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 fc6cfc9bc139db752e72885619d5342f9725bf67cec8b7ca9da9022c75c17b44 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 19:52:05,975 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 19:52:06,053 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-11-07 19:52:06,058 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 19:52:06,058 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 19:52:06,079 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 19:52:06,083 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 19:52:06,083 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 19:52:06,083 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 19:52:06,084 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 19:52:06,084 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 19:52:06,084 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 19:52:06,085 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 19:52:06,085 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 19:52:06,085 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 19:52:06,085 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 19:52:06,085 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 19:52:06,085 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 19:52:06,085 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 19:52:06,086 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 19:52:06,086 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 19:52:06,086 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 19:52:06,086 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 19:52:06,086 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-07 19:52:06,086 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 19:52:06,086 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 19:52:06,086 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 19:52:06,087 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 19:52:06,087 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 19:52:06,087 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 19:52:06,087 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 19:52:06,087 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 19:52:06,087 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 19:52:06,087 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 19:52:06,087 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 19:52:06,088 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 19:52:06,088 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 19:52:06,088 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 19:52:06,088 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 19:52:06,088 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 19:52:06,088 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 19:52:06,088 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> fc6cfc9bc139db752e72885619d5342f9725bf67cec8b7ca9da9022c75c17b44 [2024-11-07 19:52:06,368 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 19:52:06,375 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 19:52:06,377 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 19:52:06,378 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 19:52:06,378 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 19:52:06,379 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/RecursiveNonterminating-1.c [2024-11-07 19:52:07,608 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 19:52:07,800 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 19:52:07,801 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-crafted/RecursiveNonterminating-1.c [2024-11-07 19:52:07,808 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/569812e85/ca2e82d04bcb44e6a684945056629e04/FLAGd849fad6a [2024-11-07 19:52:07,824 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/569812e85/ca2e82d04bcb44e6a684945056629e04 [2024-11-07 19:52:07,827 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 19:52:07,828 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 19:52:07,830 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 19:52:07,831 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 19:52:07,834 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 19:52:07,835 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:52:07" (1/1) ... [2024-11-07 19:52:07,836 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32c75d03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:52:07, skipping insertion in model container [2024-11-07 19:52:07,836 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:52:07" (1/1) ... [2024-11-07 19:52:07,848 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 19:52:07,974 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 19:52:07,978 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 19:52:07,994 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 19:52:08,006 INFO L204 MainTranslator]: Completed translation [2024-11-07 19:52:08,007 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:52:08 WrapperNode [2024-11-07 19:52:08,007 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 19:52:08,008 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 19:52:08,008 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 19:52:08,008 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 19:52:08,013 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:52:08" (1/1) ... [2024-11-07 19:52:08,017 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:52:08" (1/1) ... [2024-11-07 19:52:08,029 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 14 [2024-11-07 19:52:08,031 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 19:52:08,031 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 19:52:08,031 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 19:52:08,031 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 19:52:08,038 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:52:08" (1/1) ... [2024-11-07 19:52:08,039 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:52:08" (1/1) ... [2024-11-07 19:52:08,040 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:52:08" (1/1) ... [2024-11-07 19:52:08,047 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-07 19:52:08,047 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:52:08" (1/1) ... [2024-11-07 19:52:08,047 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:52:08" (1/1) ... [2024-11-07 19:52:08,048 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:52:08" (1/1) ... [2024-11-07 19:52:08,049 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:52:08" (1/1) ... [2024-11-07 19:52:08,050 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:52:08" (1/1) ... [2024-11-07 19:52:08,051 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:52:08" (1/1) ... [2024-11-07 19:52:08,052 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 19:52:08,053 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 19:52:08,054 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 19:52:08,054 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 19:52:08,055 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:52:08" (1/1) ... [2024-11-07 19:52:08,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 19:52:08,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 19:52:08,092 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 19:52:08,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 19:52:08,115 INFO L130 BoogieDeclarations]: Found specification of procedure rec [2024-11-07 19:52:08,116 INFO L138 BoogieDeclarations]: Found implementation of procedure rec [2024-11-07 19:52:08,116 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 19:52:08,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 19:52:08,166 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 19:52:08,168 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 19:52:08,278 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-07 19:52:08,278 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 19:52:08,285 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 19:52:08,286 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-07 19:52:08,286 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:52:08 BoogieIcfgContainer [2024-11-07 19:52:08,286 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 19:52:08,289 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 19:52:08,289 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 19:52:08,293 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 19:52:08,294 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:52:07" (1/3) ... [2024-11-07 19:52:08,295 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22a115b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:52:08, skipping insertion in model container [2024-11-07 19:52:08,295 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:52:08" (2/3) ... [2024-11-07 19:52:08,295 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22a115b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:52:08, skipping insertion in model container [2024-11-07 19:52:08,296 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:52:08" (3/3) ... [2024-11-07 19:52:08,297 INFO L112 eAbstractionObserver]: Analyzing ICFG RecursiveNonterminating-1.c [2024-11-07 19:52:08,310 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 19:52:08,311 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-11-07 19:52:08,361 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 19:52:08,373 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;@6433aff0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 19:52:08,374 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-07 19:52:08,378 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 17 states have (on average 1.588235294117647) internal successors, (27), 26 states have internal predecessors, (27), 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-11-07 19:52:08,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-07 19:52:08,383 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 19:52:08,384 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-07 19:52:08,385 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-07 19:52:08,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:52:08,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1572132, now seen corresponding path program 1 times [2024-11-07 19:52:08,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:52:08,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532240914] [2024-11-07 19:52:08,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:52:08,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:52:08,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:52:08,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:52:08,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:52:08,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532240914] [2024-11-07 19:52:08,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532240914] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:52:08,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:52:08,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 19:52:08,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785446385] [2024-11-07 19:52:08,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:52:08,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:52:08,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:52:08,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:52:08,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:52:08,547 INFO L87 Difference]: Start difference. First operand has 29 states, 17 states have (on average 1.588235294117647) internal successors, (27), 26 states have internal predecessors, (27), 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) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:52:08,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 19:52:08,583 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2024-11-07 19:52:08,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:52:08,587 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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) Word has length 4 [2024-11-07 19:52:08,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 19:52:08,592 INFO L225 Difference]: With dead ends: 30 [2024-11-07 19:52:08,592 INFO L226 Difference]: Without dead ends: 22 [2024-11-07 19:52:08,594 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:52:08,596 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 3 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 19:52:08,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 47 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 19:52:08,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-07 19:52:08,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-11-07 19:52:08,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 20 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:52:08,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2024-11-07 19:52:08,631 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 4 [2024-11-07 19:52:08,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 19:52:08,631 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2024-11-07 19:52:08,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:52:08,631 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2024-11-07 19:52:08,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-07 19:52:08,632 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 19:52:08,632 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-07 19:52:08,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 19:52:08,633 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-07 19:52:08,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:52:08,635 INFO L85 PathProgramCache]: Analyzing trace with hash 48736154, now seen corresponding path program 1 times [2024-11-07 19:52:08,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:52:08,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046564302] [2024-11-07 19:52:08,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:52:08,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:52:08,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:52:08,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:52:08,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:52:08,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046564302] [2024-11-07 19:52:08,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046564302] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:52:08,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:52:08,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 19:52:08,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504233105] [2024-11-07 19:52:08,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:52:08,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:52:08,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:52:08,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:52:08,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:52:08,671 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:52:08,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 19:52:08,681 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2024-11-07 19:52:08,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:52:08,683 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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) Word has length 5 [2024-11-07 19:52:08,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 19:52:08,684 INFO L225 Difference]: With dead ends: 22 [2024-11-07 19:52:08,684 INFO L226 Difference]: Without dead ends: 21 [2024-11-07 19:52:08,684 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:52:08,684 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 1 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 19:52:08,685 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 36 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 19:52:08,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-07 19:52:08,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-11-07 19:52:08,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 19 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:52:08,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2024-11-07 19:52:08,691 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 5 [2024-11-07 19:52:08,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 19:52:08,692 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2024-11-07 19:52:08,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:52:08,692 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2024-11-07 19:52:08,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-07 19:52:08,692 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 19:52:08,692 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:52:08,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 19:52:08,694 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-07 19:52:08,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:52:08,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1901498708, now seen corresponding path program 1 times [2024-11-07 19:52:08,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:52:08,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511769605] [2024-11-07 19:52:08,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:52:08,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:52:08,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:52:08,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:52:08,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:52:08,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511769605] [2024-11-07 19:52:08,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511769605] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:52:08,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:52:08,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 19:52:08,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88240566] [2024-11-07 19:52:08,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:52:08,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 19:52:08,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:52:08,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 19:52:08,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 19:52:08,820 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:52:08,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 19:52:08,942 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2024-11-07 19:52:08,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 19:52:08,943 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-07 19:52:08,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 19:52:08,943 INFO L225 Difference]: With dead ends: 36 [2024-11-07 19:52:08,943 INFO L226 Difference]: Without dead ends: 34 [2024-11-07 19:52:08,944 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 19:52:08,944 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 27 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 19:52:08,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 44 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 19:52:08,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-07 19:52:08,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 26. [2024-11-07 19:52:08,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 23 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:52:08,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2024-11-07 19:52:08,950 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 9 [2024-11-07 19:52:08,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 19:52:08,950 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2024-11-07 19:52:08,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:52:08,951 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2024-11-07 19:52:08,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-07 19:52:08,951 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 19:52:08,951 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:52:08,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 19:52:08,951 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-07 19:52:08,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:52:08,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1183082159, now seen corresponding path program 1 times [2024-11-07 19:52:08,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:52:08,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249863399] [2024-11-07 19:52:08,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:52:08,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:52:08,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:52:09,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:52:09,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:52:09,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249863399] [2024-11-07 19:52:09,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249863399] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:52:09,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:52:09,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 19:52:09,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743729568] [2024-11-07 19:52:09,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:52:09,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 19:52:09,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:52:09,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 19:52:09,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 19:52:09,010 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:52:09,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 19:52:09,086 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2024-11-07 19:52:09,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 19:52:09,087 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-07 19:52:09,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 19:52:09,087 INFO L225 Difference]: With dead ends: 34 [2024-11-07 19:52:09,087 INFO L226 Difference]: Without dead ends: 32 [2024-11-07 19:52:09,088 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 19:52:09,088 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 24 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 19:52:09,089 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 46 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 19:52:09,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-07 19:52:09,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 27. [2024-11-07 19:52:09,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 24 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:52:09,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2024-11-07 19:52:09,092 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 10 [2024-11-07 19:52:09,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 19:52:09,092 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2024-11-07 19:52:09,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:52:09,093 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2024-11-07 19:52:09,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-07 19:52:09,093 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 19:52:09,093 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:52:09,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 19:52:09,093 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting recErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-07 19:52:09,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:52:09,093 INFO L85 PathProgramCache]: Analyzing trace with hash -698929000, now seen corresponding path program 1 times [2024-11-07 19:52:09,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:52:09,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116754501] [2024-11-07 19:52:09,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:52:09,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:52:09,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:52:09,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:52:09,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:52:09,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116754501] [2024-11-07 19:52:09,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116754501] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:52:09,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:52:09,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 19:52:09,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297642000] [2024-11-07 19:52:09,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:52:09,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:52:09,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:52:09,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:52:09,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:52:09,135 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:52:09,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 19:52:09,143 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2024-11-07 19:52:09,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:52:09,143 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-07 19:52:09,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 19:52:09,144 INFO L225 Difference]: With dead ends: 27 [2024-11-07 19:52:09,144 INFO L226 Difference]: Without dead ends: 26 [2024-11-07 19:52:09,144 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:52:09,145 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 6 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 19:52:09,147 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 24 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 19:52:09,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-07 19:52:09,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-07 19:52:09,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 19 states have (on average 1.263157894736842) internal successors, (24), 23 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:52:09,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2024-11-07 19:52:09,153 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 13 [2024-11-07 19:52:09,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 19:52:09,154 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2024-11-07 19:52:09,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:52:09,154 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2024-11-07 19:52:09,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-07 19:52:09,154 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 19:52:09,154 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:52:09,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 19:52:09,155 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting recErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-07 19:52:09,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:52:09,155 INFO L85 PathProgramCache]: Analyzing trace with hash -191962475, now seen corresponding path program 1 times [2024-11-07 19:52:09,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:52:09,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307416665] [2024-11-07 19:52:09,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:52:09,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:52:09,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:52:09,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:52:09,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:52:09,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307416665] [2024-11-07 19:52:09,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307416665] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:52:09,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:52:09,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 19:52:09,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694112029] [2024-11-07 19:52:09,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:52:09,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:52:09,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:52:09,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:52:09,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:52:09,198 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:52:09,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 19:52:09,208 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2024-11-07 19:52:09,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:52:09,209 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-07 19:52:09,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 19:52:09,209 INFO L225 Difference]: With dead ends: 26 [2024-11-07 19:52:09,209 INFO L226 Difference]: Without dead ends: 25 [2024-11-07 19:52:09,213 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:52:09,214 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 5 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 19:52:09,214 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 24 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 19:52:09,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-07 19:52:09,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-11-07 19:52:09,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 22 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:52:09,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2024-11-07 19:52:09,221 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 14 [2024-11-07 19:52:09,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 19:52:09,221 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2024-11-07 19:52:09,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:52:09,221 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2024-11-07 19:52:09,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-07 19:52:09,221 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 19:52:09,221 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:52:09,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 19:52:09,222 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-07 19:52:09,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:52:09,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1990258193, now seen corresponding path program 1 times [2024-11-07 19:52:09,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:52:09,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696097110] [2024-11-07 19:52:09,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:52:09,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:52:09,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:52:09,351 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:52:09,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:52:09,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696097110] [2024-11-07 19:52:09,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696097110] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 19:52:09,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581138229] [2024-11-07 19:52:09,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:52:09,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 19:52:09,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 19:52:09,354 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 19:52:09,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 19:52:09,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:52:09,403 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 19:52:09,407 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:52:09,498 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:52:09,499 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 19:52:09,569 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:52:09,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [581138229] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 19:52:09,571 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 19:52:09,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 12 [2024-11-07 19:52:09,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975833641] [2024-11-07 19:52:09,571 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 19:52:09,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-07 19:52:09,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:52:09,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 19:52:09,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-11-07 19:52:09,574 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 9 states have internal predecessors, (37), 4 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:52:09,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 19:52:09,881 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2024-11-07 19:52:09,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 19:52:09,882 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 9 states have internal predecessors, (37), 4 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-07 19:52:09,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 19:52:09,884 INFO L225 Difference]: With dead ends: 39 [2024-11-07 19:52:09,884 INFO L226 Difference]: Without dead ends: 37 [2024-11-07 19:52:09,886 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=394, Unknown=0, NotChecked=0, Total=506 [2024-11-07 19:52:09,887 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 84 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 19:52:09,888 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 53 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 19:52:09,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-07 19:52:09,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 23. [2024-11-07 19:52:09,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:52:09,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2024-11-07 19:52:09,896 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 18 [2024-11-07 19:52:09,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 19:52:09,896 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2024-11-07 19:52:09,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 9 states have internal predecessors, (37), 4 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:52:09,897 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2024-11-07 19:52:09,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-07 19:52:09,897 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 19:52:09,897 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:52:09,914 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-07 19:52:10,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 19:52:10,098 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-07 19:52:10,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:52:10,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1568461876, now seen corresponding path program 1 times [2024-11-07 19:52:10,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:52:10,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129736376] [2024-11-07 19:52:10,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:52:10,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:52:10,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:52:10,221 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:52:10,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:52:10,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129736376] [2024-11-07 19:52:10,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129736376] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 19:52:10,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1495254382] [2024-11-07 19:52:10,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:52:10,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 19:52:10,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 19:52:10,224 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 19:52:10,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-07 19:52:10,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:52:10,255 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 19:52:10,256 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:52:10,302 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:52:10,302 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 19:52:10,353 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:52:10,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1495254382] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 19:52:10,354 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 19:52:10,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 12 [2024-11-07 19:52:10,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620908504] [2024-11-07 19:52:10,355 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 19:52:10,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-07 19:52:10,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:52:10,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 19:52:10,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-11-07 19:52:10,356 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand has 13 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 9 states have internal predecessors, (40), 4 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:52:10,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 19:52:10,569 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2024-11-07 19:52:10,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 19:52:10,569 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 9 states have internal predecessors, (40), 4 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-07 19:52:10,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 19:52:10,570 INFO L225 Difference]: With dead ends: 35 [2024-11-07 19:52:10,570 INFO L226 Difference]: Without dead ends: 0 [2024-11-07 19:52:10,570 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2024-11-07 19:52:10,571 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 69 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 19:52:10,571 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 66 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 19:52:10,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-07 19:52:10,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-07 19:52:10,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:52:10,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-07 19:52:10,571 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2024-11-07 19:52:10,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 19:52:10,571 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-07 19:52:10,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 9 states have internal predecessors, (40), 4 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:52:10,572 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-07 19:52:10,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-07 19:52:10,576 INFO L782 garLoopResultBuilder]: Registering result SAFE for location recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2024-11-07 19:52:10,578 INFO L782 garLoopResultBuilder]: Registering result SAFE for location recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2024-11-07 19:52:10,579 INFO L782 garLoopResultBuilder]: Registering result SAFE for location recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2024-11-07 19:52:10,579 INFO L782 garLoopResultBuilder]: Registering result SAFE for location recErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2024-11-07 19:52:10,580 INFO L782 garLoopResultBuilder]: Registering result SAFE for location recErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2024-11-07 19:52:10,580 INFO L782 garLoopResultBuilder]: Registering result SAFE for location recErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2024-11-07 19:52:10,580 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2024-11-07 19:52:10,580 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2024-11-07 19:52:10,596 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-07 19:52:10,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 19:52:10,788 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:52:10,790 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-07 19:52:11,363 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 19:52:11,426 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 07:52:11 BoogieIcfgContainer [2024-11-07 19:52:11,427 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 19:52:11,427 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 19:52:11,427 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 19:52:11,428 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 19:52:11,428 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:52:08" (3/4) ... [2024-11-07 19:52:11,431 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-07 19:52:11,435 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure rec [2024-11-07 19:52:11,439 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-11-07 19:52:11,440 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-07 19:52:11,440 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-07 19:52:11,504 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-07 19:52:11,504 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-07 19:52:11,504 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 19:52:11,505 INFO L158 Benchmark]: Toolchain (without parser) took 3677.04ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 91.9MB in the beginning and 106.7MB in the end (delta: -14.8MB). Peak memory consumption was 28.9MB. Max. memory is 16.1GB. [2024-11-07 19:52:11,505 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 117.4MB. Free memory is still 80.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:52:11,506 INFO L158 Benchmark]: CACSL2BoogieTranslator took 177.11ms. Allocated memory is still 117.4MB. Free memory was 91.8MB in the beginning and 81.9MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 19:52:11,506 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.89ms. Allocated memory is still 117.4MB. Free memory was 81.9MB in the beginning and 80.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:52:11,506 INFO L158 Benchmark]: Boogie Preprocessor took 21.74ms. Allocated memory is still 117.4MB. Free memory was 80.9MB in the beginning and 80.1MB in the end (delta: 857.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:52:11,507 INFO L158 Benchmark]: RCFGBuilder took 232.68ms. Allocated memory is still 117.4MB. Free memory was 80.1MB in the beginning and 70.7MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 19:52:11,507 INFO L158 Benchmark]: TraceAbstraction took 3137.47ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 70.0MB in the beginning and 111.6MB in the end (delta: -41.6MB). Peak memory consumption was 37.5MB. Max. memory is 16.1GB. [2024-11-07 19:52:11,507 INFO L158 Benchmark]: Witness Printer took 77.21ms. Allocated memory is still 159.4MB. Free memory was 111.6MB in the beginning and 106.7MB in the end (delta: 4.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 19:52:11,508 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.19ms. Allocated memory is still 117.4MB. Free memory is still 80.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 177.11ms. Allocated memory is still 117.4MB. Free memory was 91.8MB in the beginning and 81.9MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.89ms. Allocated memory is still 117.4MB. Free memory was 81.9MB in the beginning and 80.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 21.74ms. Allocated memory is still 117.4MB. Free memory was 80.9MB in the beginning and 80.1MB in the end (delta: 857.8kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 232.68ms. Allocated memory is still 117.4MB. Free memory was 80.1MB in the beginning and 70.7MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 3137.47ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 70.0MB in the beginning and 111.6MB in the end (delta: -41.6MB). Peak memory consumption was 37.5MB. Max. memory is 16.1GB. * Witness Printer took 77.21ms. Allocated memory is still 159.4MB. Free memory was 111.6MB in the beginning and 106.7MB in the end (delta: 4.9MB). Peak memory consumption was 8.4MB. 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: 12]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 12]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 12]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 12]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 12]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 12]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 19]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 19]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 29 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 2.4s, OverallIterations: 8, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 220 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 219 mSDsluCounter, 340 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 223 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 379 IncrementalHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 117 mSDtfsCounter, 379 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 124 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=0, InterpolantAutomatonStates: 48, 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, 27 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 129 NumberOfCodeBlocks, 129 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 154 ConstructedInterpolants, 0 QuantifiedInterpolants, 450 SizeOfPredicates, 2 NumberOfNonLiveVariables, 79 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 12 InterpolantComputations, 6 PerfectInterpolantSequences, 8/21 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - ProcedureContractResult [Line: 10]: Procedure Contract for rec Derived contract for procedure rec. Requires: (((((((long) 2 * y) <= ((long) 2 + x)) && (((0 <= ((long) 41 + y)) && (y <= ((long) x + 1))) || ((((long) 2 + x) == ((long) 2 * y)) && (0 <= ((long) 41 + y))))) && (y <= 24)) || (y == ((long) x + 1))) || ((((0 <= ((long) 41 + y)) && (((long) x + 1) <= y)) && (y <= 24)) && (((long) 2 + x) <= ((long) 2 * y)))) Ensures: (((((((long) 2 * y) <= ((long) 2 + x)) && (((0 <= ((long) 41 + y)) && (y <= ((long) x + 1))) || ((((long) 2 + x) == ((long) 2 * y)) && (0 <= ((long) 41 + y))))) && (y <= 24)) || (y == ((long) x + 1))) || ((((0 <= ((long) 41 + y)) && (((long) x + 1) <= y)) && (y <= 24)) && (((long) 2 + x) <= ((long) 2 * y)))) RESULT: Ultimate proved your program to be correct! [2024-11-07 19:52:11,534 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE