./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_max_preinc_09_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_max_preinc_09_good.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 7f28571fd79b5fb6d21213e46e33e9090c3dd967c8142f7e7eec7de04c4d24ce --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 22:25:17,991 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 22:25:18,057 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-10-14 22:25:18,062 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 22:25:18,064 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 22:25:18,086 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 22:25:18,086 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 22:25:18,087 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 22:25:18,087 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 22:25:18,088 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 22:25:18,089 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 22:25:18,089 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 22:25:18,089 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 22:25:18,091 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 22:25:18,091 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 22:25:18,091 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 22:25:18,091 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 22:25:18,092 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 22:25:18,092 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 22:25:18,092 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 22:25:18,092 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 22:25:18,093 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 22:25:18,094 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 22:25:18,094 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-14 22:25:18,094 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 22:25:18,094 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 22:25:18,095 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 22:25:18,095 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 22:25:18,095 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 22:25:18,095 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 22:25:18,095 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 22:25:18,096 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 22:25:18,096 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 22:25:18,096 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 22:25:18,097 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 22:25:18,097 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 22:25:18,097 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 22:25:18,097 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 22:25:18,097 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 22:25:18,097 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 22:25:18,098 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 22:25:18,098 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7f28571fd79b5fb6d21213e46e33e9090c3dd967c8142f7e7eec7de04c4d24ce [2024-10-14 22:25:18,301 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 22:25:18,322 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 22:25:18,325 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 22:25:18,326 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 22:25:18,326 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 22:25:18,327 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_max_preinc_09_good.i [2024-10-14 22:25:19,624 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 22:25:19,906 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 22:25:19,907 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_max_preinc_09_good.i [2024-10-14 22:25:19,929 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/393cde979/a6d854b5eb0c43b49ba412a04208d129/FLAG1a6674ca0 [2024-10-14 22:25:19,943 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/393cde979/a6d854b5eb0c43b49ba412a04208d129 [2024-10-14 22:25:19,945 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 22:25:19,946 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 22:25:19,949 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 22:25:19,949 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 22:25:19,953 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 22:25:19,954 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:25:19" (1/1) ... [2024-10-14 22:25:19,956 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fb146f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:25:19, skipping insertion in model container [2024-10-14 22:25:19,956 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:25:19" (1/1) ... [2024-10-14 22:25:20,001 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 22:25:20,532 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 22:25:20,541 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 22:25:20,605 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 22:25:20,739 INFO L204 MainTranslator]: Completed translation [2024-10-14 22:25:20,740 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:25:20 WrapperNode [2024-10-14 22:25:20,740 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 22:25:20,741 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 22:25:20,741 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 22:25:20,741 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 22:25:20,751 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:25:20" (1/1) ... [2024-10-14 22:25:20,772 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:25:20" (1/1) ... [2024-10-14 22:25:20,793 INFO L138 Inliner]: procedures = 501, calls = 38, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 101 [2024-10-14 22:25:20,794 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 22:25:20,794 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 22:25:20,795 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 22:25:20,795 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 22:25:20,803 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:25:20" (1/1) ... [2024-10-14 22:25:20,804 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:25:20" (1/1) ... [2024-10-14 22:25:20,806 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:25:20" (1/1) ... [2024-10-14 22:25:20,819 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-14 22:25:20,819 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:25:20" (1/1) ... [2024-10-14 22:25:20,819 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:25:20" (1/1) ... [2024-10-14 22:25:20,827 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:25:20" (1/1) ... [2024-10-14 22:25:20,831 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:25:20" (1/1) ... [2024-10-14 22:25:20,832 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:25:20" (1/1) ... [2024-10-14 22:25:20,834 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:25:20" (1/1) ... [2024-10-14 22:25:20,835 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 22:25:20,839 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 22:25:20,839 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 22:25:20,839 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 22:25:20,840 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:25:20" (1/1) ... [2024-10-14 22:25:20,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 22:25:20,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 22:25:20,867 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 22:25:20,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 22:25:20,904 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2024-10-14 22:25:20,904 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2024-10-14 22:25:20,904 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-10-14 22:25:20,904 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-10-14 22:25:20,905 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 22:25:20,905 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 22:25:20,905 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 22:25:21,009 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 22:25:21,011 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 22:25:21,132 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2024-10-14 22:25:21,132 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 22:25:21,158 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 22:25:21,159 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-14 22:25:21,159 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:25:21 BoogieIcfgContainer [2024-10-14 22:25:21,159 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 22:25:21,161 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 22:25:21,161 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 22:25:21,163 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 22:25:21,163 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 10:25:19" (1/3) ... [2024-10-14 22:25:21,164 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@504ec132 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:25:21, skipping insertion in model container [2024-10-14 22:25:21,164 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:25:20" (2/3) ... [2024-10-14 22:25:21,164 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@504ec132 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:25:21, skipping insertion in model container [2024-10-14 22:25:21,164 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:25:21" (3/3) ... [2024-10-14 22:25:21,165 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_max_preinc_09_good.i [2024-10-14 22:25:21,179 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 22:25:21,179 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-10-14 22:25:21,227 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 22:25:21,233 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;@5fb38b53, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 22:25:21,236 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-10-14 22:25:21,241 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 37 states have (on average 1.5135135135135136) internal successors, (56), 45 states have internal predecessors, (56), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-14 22:25:21,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-14 22:25:21,245 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 22:25:21,247 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 22:25:21,248 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 22:25:21,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 22:25:21,251 INFO L85 PathProgramCache]: Analyzing trace with hash 592525310, now seen corresponding path program 1 times [2024-10-14 22:25:21,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 22:25:21,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445679713] [2024-10-14 22:25:21,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 22:25:21,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 22:25:21,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 22:25:21,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 22:25:21,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 22:25:21,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 22:25:21,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 22:25:21,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445679713] [2024-10-14 22:25:21,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445679713] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 22:25:21,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 22:25:21,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 22:25:21,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476939962] [2024-10-14 22:25:21,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 22:25:21,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 22:25:21,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 22:25:21,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 22:25:21,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 22:25:21,470 INFO L87 Difference]: Start difference. First operand has 58 states, 37 states have (on average 1.5135135135135136) internal successors, (56), 45 states have internal predecessors, (56), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 22:25:21,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 22:25:21,513 INFO L93 Difference]: Finished difference Result 111 states and 144 transitions. [2024-10-14 22:25:21,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 22:25:21,515 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-10-14 22:25:21,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 22:25:21,520 INFO L225 Difference]: With dead ends: 111 [2024-10-14 22:25:21,520 INFO L226 Difference]: Without dead ends: 57 [2024-10-14 22:25:21,522 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 22:25:21,524 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 2 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 22:25:21,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 135 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 22:25:21,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-10-14 22:25:21,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2024-10-14 22:25:21,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 36 states have (on average 1.5) internal successors, (54), 43 states have internal predecessors, (54), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-14 22:25:21,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 70 transitions. [2024-10-14 22:25:21,552 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 70 transitions. Word has length 11 [2024-10-14 22:25:21,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 22:25:21,553 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 70 transitions. [2024-10-14 22:25:21,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 22:25:21,553 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 70 transitions. [2024-10-14 22:25:21,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-14 22:25:21,554 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 22:25:21,554 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 22:25:21,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 22:25:21,554 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 22:25:21,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 22:25:21,554 INFO L85 PathProgramCache]: Analyzing trace with hash 592584892, now seen corresponding path program 1 times [2024-10-14 22:25:21,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 22:25:21,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120842373] [2024-10-14 22:25:21,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 22:25:21,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 22:25:21,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 22:25:21,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 22:25:21,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 22:25:21,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 22:25:21,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 22:25:21,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120842373] [2024-10-14 22:25:21,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120842373] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 22:25:21,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 22:25:21,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 22:25:21,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466542] [2024-10-14 22:25:21,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 22:25:21,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 22:25:21,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 22:25:21,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 22:25:21,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 22:25:21,632 INFO L87 Difference]: Start difference. First operand 54 states and 70 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 22:25:21,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 22:25:21,658 INFO L93 Difference]: Finished difference Result 94 states and 120 transitions. [2024-10-14 22:25:21,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 22:25:21,660 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-10-14 22:25:21,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 22:25:21,664 INFO L225 Difference]: With dead ends: 94 [2024-10-14 22:25:21,664 INFO L226 Difference]: Without dead ends: 46 [2024-10-14 22:25:21,664 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 22:25:21,665 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 51 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 22:25:21,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 46 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 22:25:21,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-14 22:25:21,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-10-14 22:25:21,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 36 states have internal predecessors, (40), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-14 22:25:21,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2024-10-14 22:25:21,674 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 11 [2024-10-14 22:25:21,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 22:25:21,674 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2024-10-14 22:25:21,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 22:25:21,674 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2024-10-14 22:25:21,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-14 22:25:21,675 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 22:25:21,675 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 22:25:21,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 22:25:21,675 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 22:25:21,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 22:25:21,676 INFO L85 PathProgramCache]: Analyzing trace with hash -859746870, now seen corresponding path program 1 times [2024-10-14 22:25:21,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 22:25:21,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993592484] [2024-10-14 22:25:21,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 22:25:21,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 22:25:21,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 22:25:21,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 22:25:21,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 22:25:21,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 22:25:21,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 22:25:21,735 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 22:25:21,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 22:25:21,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993592484] [2024-10-14 22:25:21,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993592484] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 22:25:21,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 22:25:21,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 22:25:21,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911960566] [2024-10-14 22:25:21,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 22:25:21,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 22:25:21,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 22:25:21,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 22:25:21,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 22:25:21,741 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 22:25:21,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 22:25:21,757 INFO L93 Difference]: Finished difference Result 80 states and 91 transitions. [2024-10-14 22:25:21,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 22:25:21,758 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2024-10-14 22:25:21,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 22:25:21,758 INFO L225 Difference]: With dead ends: 80 [2024-10-14 22:25:21,759 INFO L226 Difference]: Without dead ends: 42 [2024-10-14 22:25:21,759 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 22:25:21,760 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 42 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 22:25:21,760 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 42 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 22:25:21,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-14 22:25:21,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-10-14 22:25:21,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 34 states have internal predecessors, (36), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-14 22:25:21,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2024-10-14 22:25:21,766 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 20 [2024-10-14 22:25:21,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 22:25:21,766 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2024-10-14 22:25:21,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 22:25:21,766 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2024-10-14 22:25:21,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-14 22:25:21,767 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 22:25:21,767 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 22:25:21,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 22:25:21,767 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 22:25:21,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 22:25:21,783 INFO L85 PathProgramCache]: Analyzing trace with hash 155214931, now seen corresponding path program 1 times [2024-10-14 22:25:21,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 22:25:21,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676322352] [2024-10-14 22:25:21,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 22:25:21,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 22:25:21,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 22:25:21,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 22:25:21,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 22:25:21,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 22:25:21,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 22:25:21,846 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 22:25:21,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 22:25:21,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676322352] [2024-10-14 22:25:21,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676322352] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 22:25:21,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 22:25:21,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 22:25:21,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60923910] [2024-10-14 22:25:21,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 22:25:21,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 22:25:21,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 22:25:21,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 22:25:21,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 22:25:21,848 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 22:25:21,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 22:25:21,864 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2024-10-14 22:25:21,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 22:25:21,864 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2024-10-14 22:25:21,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 22:25:21,865 INFO L225 Difference]: With dead ends: 60 [2024-10-14 22:25:21,865 INFO L226 Difference]: Without dead ends: 36 [2024-10-14 22:25:21,865 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 22:25:21,866 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 22:25:21,866 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 22:25:21,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-10-14 22:25:21,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-10-14 22:25:21,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 29 states have internal predecessors, (30), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 22:25:21,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2024-10-14 22:25:21,873 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 21 [2024-10-14 22:25:21,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 22:25:21,873 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2024-10-14 22:25:21,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 22:25:21,875 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2024-10-14 22:25:21,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-14 22:25:21,875 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 22:25:21,875 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 22:25:21,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 22:25:21,876 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 22:25:21,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 22:25:21,876 INFO L85 PathProgramCache]: Analyzing trace with hash 646908377, now seen corresponding path program 1 times [2024-10-14 22:25:21,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 22:25:21,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992329390] [2024-10-14 22:25:21,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 22:25:21,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 22:25:21,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 22:25:21,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 22:25:21,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 22:25:21,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 22:25:21,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 22:25:21,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 22:25:21,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 22:25:21,932 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-14 22:25:21,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 22:25:21,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992329390] [2024-10-14 22:25:21,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992329390] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 22:25:21,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 22:25:21,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 22:25:21,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906323255] [2024-10-14 22:25:21,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 22:25:21,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 22:25:21,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 22:25:21,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 22:25:21,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 22:25:21,936 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 22:25:21,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 22:25:21,954 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2024-10-14 22:25:21,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 22:25:21,955 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 30 [2024-10-14 22:25:21,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 22:25:21,955 INFO L225 Difference]: With dead ends: 36 [2024-10-14 22:25:21,955 INFO L226 Difference]: Without dead ends: 34 [2024-10-14 22:25:21,956 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 22:25:21,956 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 1 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 22:25:21,956 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 60 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 22:25:21,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-10-14 22:25:21,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-10-14 22:25:21,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 27 states have internal predecessors, (28), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 22:25:21,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2024-10-14 22:25:21,960 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 30 [2024-10-14 22:25:21,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 22:25:21,960 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2024-10-14 22:25:21,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 22:25:21,961 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2024-10-14 22:25:21,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-14 22:25:21,961 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 22:25:21,962 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 22:25:21,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 22:25:21,962 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 22:25:21,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 22:25:21,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1776250326, now seen corresponding path program 1 times [2024-10-14 22:25:21,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 22:25:21,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053930106] [2024-10-14 22:25:21,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 22:25:21,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 22:25:21,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 22:25:22,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 22:25:22,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 22:25:22,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 22:25:22,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 22:25:22,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 22:25:22,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 22:25:22,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 22:25:22,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 22:25:22,023 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-14 22:25:22,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 22:25:22,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053930106] [2024-10-14 22:25:22,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053930106] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 22:25:22,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 22:25:22,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 22:25:22,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780263704] [2024-10-14 22:25:22,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 22:25:22,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 22:25:22,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 22:25:22,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 22:25:22,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 22:25:22,028 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-14 22:25:22,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 22:25:22,041 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2024-10-14 22:25:22,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 22:25:22,042 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 39 [2024-10-14 22:25:22,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 22:25:22,042 INFO L225 Difference]: With dead ends: 34 [2024-10-14 22:25:22,042 INFO L226 Difference]: Without dead ends: 0 [2024-10-14 22:25:22,042 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 22:25:22,043 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 1 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 22:25:22,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 59 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 22:25:22,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-14 22:25:22,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-14 22:25:22,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 22:25:22,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-14 22:25:22,044 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2024-10-14 22:25:22,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 22:25:22,044 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-14 22:25:22,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-14 22:25:22,044 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-14 22:25:22,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-14 22:25:22,052 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2024-10-14 22:25:22,052 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2024-10-14 22:25:22,052 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2024-10-14 22:25:22,053 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2024-10-14 22:25:22,053 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2024-10-14 22:25:22,053 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2024-10-14 22:25:22,053 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2024-10-14 22:25:22,053 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2024-10-14 22:25:22,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 22:25:22,056 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-14 22:25:22,058 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-14 22:25:22,123 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 22:25:22,136 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 10:25:22 BoogieIcfgContainer [2024-10-14 22:25:22,137 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 22:25:22,138 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 22:25:22,138 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 22:25:22,139 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 22:25:22,139 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:25:21" (3/4) ... [2024-10-14 22:25:22,141 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-14 22:25:22,144 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2024-10-14 22:25:22,144 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2024-10-14 22:25:22,149 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2024-10-14 22:25:22,150 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2024-10-14 22:25:22,150 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-14 22:25:22,150 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-14 22:25:22,230 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 22:25:22,231 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-14 22:25:22,231 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 22:25:22,231 INFO L158 Benchmark]: Toolchain (without parser) took 2284.99ms. Allocated memory is still 190.8MB. Free memory was 118.0MB in the beginning and 103.5MB in the end (delta: 14.5MB). Peak memory consumption was 17.6MB. Max. memory is 16.1GB. [2024-10-14 22:25:22,232 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 121.6MB. Free memory is still 81.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 22:25:22,232 INFO L158 Benchmark]: CACSL2BoogieTranslator took 791.08ms. Allocated memory is still 190.8MB. Free memory was 117.5MB in the beginning and 141.5MB in the end (delta: -24.0MB). Peak memory consumption was 59.5MB. Max. memory is 16.1GB. [2024-10-14 22:25:22,232 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.86ms. Allocated memory is still 190.8MB. Free memory was 141.5MB in the beginning and 138.3MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 22:25:22,232 INFO L158 Benchmark]: Boogie Preprocessor took 44.21ms. Allocated memory is still 190.8MB. Free memory was 138.3MB in the beginning and 136.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 22:25:22,233 INFO L158 Benchmark]: RCFGBuilder took 320.56ms. Allocated memory is still 190.8MB. Free memory was 136.3MB in the beginning and 118.4MB in the end (delta: 17.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-14 22:25:22,233 INFO L158 Benchmark]: TraceAbstraction took 976.80ms. Allocated memory is still 190.8MB. Free memory was 118.4MB in the beginning and 108.8MB in the end (delta: 9.6MB). Peak memory consumption was 10.6MB. Max. memory is 16.1GB. [2024-10-14 22:25:22,233 INFO L158 Benchmark]: Witness Printer took 92.73ms. Allocated memory is still 190.8MB. Free memory was 108.8MB in the beginning and 103.5MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-14 22:25:22,235 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.13ms. Allocated memory is still 121.6MB. Free memory is still 81.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 791.08ms. Allocated memory is still 190.8MB. Free memory was 117.5MB in the beginning and 141.5MB in the end (delta: -24.0MB). Peak memory consumption was 59.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.86ms. Allocated memory is still 190.8MB. Free memory was 141.5MB in the beginning and 138.3MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 44.21ms. Allocated memory is still 190.8MB. Free memory was 138.3MB in the beginning and 136.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 320.56ms. Allocated memory is still 190.8MB. Free memory was 136.3MB in the beginning and 118.4MB in the end (delta: 17.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 976.80ms. Allocated memory is still 190.8MB. Free memory was 118.4MB in the beginning and 108.8MB in the end (delta: 9.6MB). Peak memory consumption was 10.6MB. Max. memory is 16.1GB. * Witness Printer took 92.73ms. Allocated memory is still 190.8MB. Free memory was 108.8MB in the beginning and 103.5MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 1564]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1564]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1586]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1586]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1611]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1611]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1628]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1628]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 58 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 98 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 97 mSDsluCounter, 408 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 150 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 53 IncrementalHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 258 mSDtfsCounter, 53 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58occurred in iteration=0, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 132 NumberOfCodeBlocks, 132 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 126 ConstructedInterpolants, 0 QuantifiedInterpolants, 156 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 32/32 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-14 22:25:22,257 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE