./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/loop-zilu/benchmark43_conjunctive_abstracted.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 803cd42f 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 ../sv-benchmarks/c/loop-zilu/benchmark43_conjunctive_abstracted.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-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 32bit --witnessprinter.graph.data.programhash 95b5179edb030463668b341d624243529de83b4afda6c4d2e0bf3bc1cb57b210 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 22:23:31,016 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 22:23:31,099 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-22 22:23:31,104 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 22:23:31,106 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 22:23:31,131 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 22:23:31,131 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 22:23:31,132 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 22:23:31,132 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 22:23:31,133 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 22:23:31,134 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 22:23:31,134 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 22:23:31,134 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 22:23:31,134 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 22:23:31,136 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 22:23:31,136 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 22:23:31,136 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 22:23:31,137 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 22:23:31,137 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 22:23:31,137 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 22:23:31,137 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 22:23:31,138 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 22:23:31,140 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 22:23:31,141 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 22:23:31,141 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 22:23:31,141 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-22 22:23:31,141 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-22 22:23:31,141 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 22:23:31,141 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 22:23:31,142 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 22:23:31,142 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 22:23:31,142 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 22:23:31,142 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 22:23:31,142 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 22:23:31,142 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 22:23:31,142 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 22:23:31,143 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 22:23:31,143 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 22:23:31,143 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 22:23:31,143 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 22:23:31,143 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 22:23:31,144 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 22:23:31,144 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 22:23:31,144 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 22:23:31,144 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 95b5179edb030463668b341d624243529de83b4afda6c4d2e0bf3bc1cb57b210 [2024-11-22 22:23:31,341 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 22:23:31,358 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 22:23:31,360 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 22:23:31,360 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 22:23:31,361 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 22:23:31,361 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-zilu/benchmark43_conjunctive_abstracted.i [2024-11-22 22:23:32,559 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 22:23:32,717 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 22:23:32,717 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-zilu/benchmark43_conjunctive_abstracted.i [2024-11-22 22:23:32,724 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c3856e65/7ebc459878344164a6d129587bccaf04/FLAG86abd34ee [2024-11-22 22:23:32,738 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c3856e65/7ebc459878344164a6d129587bccaf04 [2024-11-22 22:23:32,740 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 22:23:32,742 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 22:23:32,745 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 22:23:32,745 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 22:23:32,749 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 22:23:32,750 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:23:32" (1/1) ... [2024-11-22 22:23:32,752 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@432feea1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:23:32, skipping insertion in model container [2024-11-22 22:23:32,752 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:23:32" (1/1) ... [2024-11-22 22:23:32,776 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 22:23:32,925 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 22:23:32,933 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 22:23:32,959 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 22:23:32,971 INFO L204 MainTranslator]: Completed translation [2024-11-22 22:23:32,972 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:23:32 WrapperNode [2024-11-22 22:23:32,972 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 22:23:32,973 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 22:23:32,973 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 22:23:32,973 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 22:23:32,995 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:23:32" (1/1) ... [2024-11-22 22:23:33,000 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:23:32" (1/1) ... [2024-11-22 22:23:33,016 INFO L138 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 74 [2024-11-22 22:23:33,017 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 22:23:33,017 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 22:23:33,018 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 22:23:33,018 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 22:23:33,027 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:23:32" (1/1) ... [2024-11-22 22:23:33,027 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:23:32" (1/1) ... [2024-11-22 22:23:33,033 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:23:32" (1/1) ... [2024-11-22 22:23:33,043 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-22 22:23:33,044 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:23:32" (1/1) ... [2024-11-22 22:23:33,044 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:23:32" (1/1) ... [2024-11-22 22:23:33,047 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:23:32" (1/1) ... [2024-11-22 22:23:33,049 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:23:32" (1/1) ... [2024-11-22 22:23:33,054 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:23:32" (1/1) ... [2024-11-22 22:23:33,058 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:23:32" (1/1) ... [2024-11-22 22:23:33,059 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 22:23:33,059 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 22:23:33,060 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 22:23:33,060 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 22:23:33,063 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:23:32" (1/1) ... [2024-11-22 22:23:33,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 22:23:33,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 22:23:33,087 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-11-22 22:23:33,090 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-11-22 22:23:33,121 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 22:23:33,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 22:23:33,121 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 22:23:33,121 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 22:23:33,164 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 22:23:33,166 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 22:23:33,308 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-22 22:23:33,308 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 22:23:33,318 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 22:23:33,319 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-22 22:23:33,319 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:23:33 BoogieIcfgContainer [2024-11-22 22:23:33,319 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 22:23:33,322 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 22:23:33,322 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 22:23:33,325 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 22:23:33,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 10:23:32" (1/3) ... [2024-11-22 22:23:33,325 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24fce5e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:23:33, skipping insertion in model container [2024-11-22 22:23:33,326 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:23:32" (2/3) ... [2024-11-22 22:23:33,327 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24fce5e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:23:33, skipping insertion in model container [2024-11-22 22:23:33,327 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:23:33" (3/3) ... [2024-11-22 22:23:33,328 INFO L112 eAbstractionObserver]: Analyzing ICFG benchmark43_conjunctive_abstracted.i [2024-11-22 22:23:33,340 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 22:23:33,340 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-22 22:23:33,387 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 22:23:33,392 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;@2d452440, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 22:23:33,392 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-22 22:23:33,395 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 31 states have internal predecessors, (44), 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-22 22:23:33,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-22 22:23:33,401 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 22:23:33,403 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 22:23:33,404 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-22 22:23:33,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 22:23:33,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1219089021, now seen corresponding path program 1 times [2024-11-22 22:23:33,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 22:23:33,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567949378] [2024-11-22 22:23:33,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 22:23:33,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 22:23:33,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 22:23:33,528 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-22 22:23:33,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 22:23:33,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567949378] [2024-11-22 22:23:33,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567949378] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 22:23:33,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 22:23:33,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 22:23:33,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050920566] [2024-11-22 22:23:33,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 22:23:33,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 22:23:33,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 22:23:33,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 22:23:33,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 22:23:33,556 INFO L87 Difference]: Start difference. First operand has 32 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 31 states have internal predecessors, (44), 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) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-22 22:23:33,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 22:23:33,565 INFO L93 Difference]: Finished difference Result 52 states and 69 transitions. [2024-11-22 22:23:33,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 22:23:33,567 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 9 [2024-11-22 22:23:33,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 22:23:33,571 INFO L225 Difference]: With dead ends: 52 [2024-11-22 22:23:33,571 INFO L226 Difference]: Without dead ends: 20 [2024-11-22 22:23:33,573 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 22:23:33,577 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 22:23:33,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 22:23:33,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-22 22:23:33,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-11-22 22:23:33,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.4375) internal successors, (23), 19 states have internal predecessors, (23), 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-22 22:23:33,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2024-11-22 22:23:33,598 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 9 [2024-11-22 22:23:33,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 22:23:33,598 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2024-11-22 22:23:33,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-22 22:23:33,599 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2024-11-22 22:23:33,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-22 22:23:33,599 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 22:23:33,599 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 22:23:33,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-22 22:23:33,599 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-22 22:23:33,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 22:23:33,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1219090943, now seen corresponding path program 1 times [2024-11-22 22:23:33,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 22:23:33,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50495497] [2024-11-22 22:23:33,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 22:23:33,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 22:23:33,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 22:23:33,652 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-22 22:23:33,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 22:23:33,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50495497] [2024-11-22 22:23:33,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50495497] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 22:23:33,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 22:23:33,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 22:23:33,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663204786] [2024-11-22 22:23:33,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 22:23:33,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 22:23:33,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 22:23:33,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 22:23:33,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 22:23:33,655 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-22 22:23:33,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 22:23:33,663 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2024-11-22 22:23:33,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 22:23:33,664 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), 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 9 [2024-11-22 22:23:33,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 22:23:33,664 INFO L225 Difference]: With dead ends: 34 [2024-11-22 22:23:33,664 INFO L226 Difference]: Without dead ends: 20 [2024-11-22 22:23:33,665 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-22 22:23:33,665 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 22:23:33,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 22:23:33,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-22 22:23:33,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-11-22 22:23:33,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.375) internal successors, (22), 19 states have internal predecessors, (22), 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-22 22:23:33,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2024-11-22 22:23:33,672 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 9 [2024-11-22 22:23:33,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 22:23:33,672 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2024-11-22 22:23:33,672 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), 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-22 22:23:33,673 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2024-11-22 22:23:33,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-22 22:23:33,673 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 22:23:33,673 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 22:23:33,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 22:23:33,673 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-22 22:23:33,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 22:23:33,674 INFO L85 PathProgramCache]: Analyzing trace with hash 708525406, now seen corresponding path program 1 times [2024-11-22 22:23:33,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 22:23:33,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134727459] [2024-11-22 22:23:33,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 22:23:33,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 22:23:33,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 22:23:33,736 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-22 22:23:33,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 22:23:33,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134727459] [2024-11-22 22:23:33,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134727459] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 22:23:33,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 22:23:33,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 22:23:33,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444018745] [2024-11-22 22:23:33,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 22:23:33,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 22:23:33,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 22:23:33,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 22:23:33,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 22:23:33,740 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-22 22:23:33,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 22:23:33,756 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2024-11-22 22:23:33,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 22:23:33,757 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 10 [2024-11-22 22:23:33,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 22:23:33,757 INFO L225 Difference]: With dead ends: 30 [2024-11-22 22:23:33,757 INFO L226 Difference]: Without dead ends: 20 [2024-11-22 22:23:33,757 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-22 22:23:33,758 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 22:23:33,759 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 22:23:33,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-22 22:23:33,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-11-22 22:23:33,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.3125) internal successors, (21), 19 states have internal predecessors, (21), 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-22 22:23:33,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2024-11-22 22:23:33,763 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 10 [2024-11-22 22:23:33,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 22:23:33,764 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2024-11-22 22:23:33,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-22 22:23:33,765 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2024-11-22 22:23:33,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-22 22:23:33,765 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 22:23:33,765 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 22:23:33,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 22:23:33,766 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-22 22:23:33,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 22:23:33,769 INFO L85 PathProgramCache]: Analyzing trace with hash 491026198, now seen corresponding path program 1 times [2024-11-22 22:23:33,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 22:23:33,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983465903] [2024-11-22 22:23:33,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 22:23:33,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 22:23:33,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 22:23:33,842 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-22 22:23:33,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 22:23:33,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983465903] [2024-11-22 22:23:33,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983465903] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 22:23:33,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 22:23:33,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 22:23:33,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898775056] [2024-11-22 22:23:33,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 22:23:33,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 22:23:33,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 22:23:33,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 22:23:33,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 22:23:33,846 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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-22 22:23:33,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 22:23:33,878 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2024-11-22 22:23:33,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 22:23:33,878 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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 11 [2024-11-22 22:23:33,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 22:23:33,879 INFO L225 Difference]: With dead ends: 20 [2024-11-22 22:23:33,879 INFO L226 Difference]: Without dead ends: 19 [2024-11-22 22:23:33,879 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-22 22:23:33,880 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 11 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 22:23:33,880 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 8 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 22:23:33,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-11-22 22:23:33,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-11-22 22:23:33,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 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-22 22:23:33,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2024-11-22 22:23:33,885 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 11 [2024-11-22 22:23:33,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 22:23:33,885 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2024-11-22 22:23:33,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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-22 22:23:33,885 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2024-11-22 22:23:33,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-22 22:23:33,886 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 22:23:33,886 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 22:23:33,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 22:23:33,886 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-22 22:23:33,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 22:23:33,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1958056969, now seen corresponding path program 1 times [2024-11-22 22:23:33,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 22:23:33,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969685030] [2024-11-22 22:23:33,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 22:23:33,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 22:23:33,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 22:23:33,949 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-22 22:23:33,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 22:23:33,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969685030] [2024-11-22 22:23:33,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969685030] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 22:23:33,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 22:23:33,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 22:23:33,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954620109] [2024-11-22 22:23:33,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 22:23:33,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 22:23:33,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 22:23:33,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 22:23:33,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 22:23:33,951 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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-22 22:23:33,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 22:23:33,973 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2024-11-22 22:23:33,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 22:23:33,975 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), 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 12 [2024-11-22 22:23:33,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 22:23:33,975 INFO L225 Difference]: With dead ends: 19 [2024-11-22 22:23:33,976 INFO L226 Difference]: Without dead ends: 18 [2024-11-22 22:23:33,976 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-22 22:23:33,977 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 22:23:33,977 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 13 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 22:23:33,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-11-22 22:23:33,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-11-22 22:23:33,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 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-22 22:23:33,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2024-11-22 22:23:33,981 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 12 [2024-11-22 22:23:33,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 22:23:33,982 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2024-11-22 22:23:33,983 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), 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-22 22:23:33,983 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2024-11-22 22:23:33,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-22 22:23:33,984 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 22:23:33,984 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 22:23:33,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 22:23:33,984 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-22 22:23:33,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 22:23:33,985 INFO L85 PathProgramCache]: Analyzing trace with hash -570223816, now seen corresponding path program 1 times [2024-11-22 22:23:33,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 22:23:33,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438866809] [2024-11-22 22:23:33,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 22:23:33,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 22:23:33,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 22:23:34,027 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-22 22:23:34,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 22:23:34,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438866809] [2024-11-22 22:23:34,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438866809] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 22:23:34,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 22:23:34,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 22:23:34,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553214540] [2024-11-22 22:23:34,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 22:23:34,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 22:23:34,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 22:23:34,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 22:23:34,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 22:23:34,029 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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-22 22:23:34,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 22:23:34,061 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2024-11-22 22:23:34,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 22:23:34,062 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), 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 13 [2024-11-22 22:23:34,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 22:23:34,063 INFO L225 Difference]: With dead ends: 18 [2024-11-22 22:23:34,063 INFO L226 Difference]: Without dead ends: 17 [2024-11-22 22:23:34,063 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-22 22:23:34,065 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 8 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 22:23:34,065 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 7 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 22:23:34,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-11-22 22:23:34,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-11-22 22:23:34,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 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-22 22:23:34,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2024-11-22 22:23:34,071 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 13 [2024-11-22 22:23:34,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 22:23:34,071 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2024-11-22 22:23:34,071 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), 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-22 22:23:34,071 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2024-11-22 22:23:34,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-22 22:23:34,071 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 22:23:34,072 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 22:23:34,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-22 22:23:34,072 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-22 22:23:34,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 22:23:34,072 INFO L85 PathProgramCache]: Analyzing trace with hash -497069031, now seen corresponding path program 1 times [2024-11-22 22:23:34,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 22:23:34,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604541353] [2024-11-22 22:23:34,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 22:23:34,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 22:23:34,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 22:23:34,142 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-22 22:23:34,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 22:23:34,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604541353] [2024-11-22 22:23:34,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604541353] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 22:23:34,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 22:23:34,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 22:23:34,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178270838] [2024-11-22 22:23:34,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 22:23:34,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 22:23:34,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 22:23:34,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 22:23:34,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 22:23:34,143 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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-22 22:23:34,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 22:23:34,167 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2024-11-22 22:23:34,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 22:23:34,168 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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 14 [2024-11-22 22:23:34,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 22:23:34,168 INFO L225 Difference]: With dead ends: 17 [2024-11-22 22:23:34,168 INFO L226 Difference]: Without dead ends: 0 [2024-11-22 22:23:34,168 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-22 22:23:34,169 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 6 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 22:23:34,169 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 9 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 22:23:34,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-22 22:23:34,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-22 22:23:34,170 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-22 22:23:34,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-22 22:23:34,170 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2024-11-22 22:23:34,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 22:23:34,170 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-22 22:23:34,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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-22 22:23:34,170 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-22 22:23:34,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-22 22:23:34,172 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-11-22 22:23:34,173 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-11-22 22:23:34,174 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-11-22 22:23:34,174 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-11-22 22:23:34,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-22 22:23:34,176 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-22 22:23:34,177 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-22 22:23:34,182 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 22:23:34,186 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 10:23:34 BoogieIcfgContainer [2024-11-22 22:23:34,186 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 22:23:34,186 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 22:23:34,186 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 22:23:34,186 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 22:23:34,187 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:23:33" (3/4) ... [2024-11-22 22:23:34,188 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-22 22:23:34,194 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2024-11-22 22:23:34,194 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-22 22:23:34,194 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-22 22:23:34,194 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-22 22:23:34,248 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-22 22:23:34,248 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-22 22:23:34,248 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 22:23:34,248 INFO L158 Benchmark]: Toolchain (without parser) took 1506.75ms. Allocated memory is still 192.9MB. Free memory was 130.1MB in the beginning and 145.4MB in the end (delta: -15.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 22:23:34,249 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 96.5MB. Free memory is still 51.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 22:23:34,249 INFO L158 Benchmark]: CACSL2BoogieTranslator took 227.49ms. Allocated memory is still 192.9MB. Free memory was 130.1MB in the beginning and 160.6MB in the end (delta: -30.5MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. [2024-11-22 22:23:34,249 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.36ms. Allocated memory is still 192.9MB. Free memory was 160.6MB in the beginning and 159.3MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 22:23:34,249 INFO L158 Benchmark]: Boogie Preprocessor took 41.60ms. Allocated memory is still 192.9MB. Free memory was 159.3MB in the beginning and 157.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 22:23:34,249 INFO L158 Benchmark]: RCFGBuilder took 259.50ms. Allocated memory is still 192.9MB. Free memory was 157.3MB in the beginning and 143.9MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-22 22:23:34,249 INFO L158 Benchmark]: TraceAbstraction took 863.58ms. Allocated memory is still 192.9MB. Free memory was 142.6MB in the beginning and 150.6MB in the end (delta: -8.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 22:23:34,249 INFO L158 Benchmark]: Witness Printer took 62.06ms. Allocated memory is still 192.9MB. Free memory was 150.6MB in the beginning and 145.4MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-22 22:23:34,250 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.10ms. Allocated memory is still 96.5MB. Free memory is still 51.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 227.49ms. Allocated memory is still 192.9MB. Free memory was 130.1MB in the beginning and 160.6MB in the end (delta: -30.5MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.36ms. Allocated memory is still 192.9MB. Free memory was 160.6MB in the beginning and 159.3MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.60ms. Allocated memory is still 192.9MB. Free memory was 159.3MB in the beginning and 157.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 259.50ms. Allocated memory is still 192.9MB. Free memory was 157.3MB in the beginning and 143.9MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 863.58ms. Allocated memory is still 192.9MB. Free memory was 142.6MB in the beginning and 150.6MB in the end (delta: -8.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 62.06ms. Allocated memory is still 192.9MB. Free memory was 150.6MB in the beginning and 145.4MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. 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: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: 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 1 procedures, 32 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 31 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 31 mSDsluCounter, 156 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 42 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 59 IncrementalHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 114 mSDtfsCounter, 59 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=0, InterpolantAutomatonStates: 20, 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, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 78 NumberOfCodeBlocks, 78 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 71 ConstructedInterpolants, 0 QuantifiedInterpolants, 147 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 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 4 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-22 22:23:34,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE