./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-memory-alloca/c.01-no-inv-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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/termination-memory-alloca/c.01-no-inv-alloca.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 f49dce48b63f0ee8eed4ac47c25c384a83e3c23200b58c130c184e2b953e32f3 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 10:19:45,136 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 10:19:45,198 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-11-19 10:19:45,203 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 10:19:45,204 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 10:19:45,226 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 10:19:45,227 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 10:19:45,228 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 10:19:45,228 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 10:19:45,229 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 10:19:45,229 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 10:19:45,229 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 10:19:45,230 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 10:19:45,230 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 10:19:45,230 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 10:19:45,230 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 10:19:45,231 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 10:19:45,231 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 10:19:45,231 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 10:19:45,231 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 10:19:45,231 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 10:19:45,235 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 10:19:45,235 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 10:19:45,235 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-19 10:19:45,236 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 10:19:45,236 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 10:19:45,236 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 10:19:45,237 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 10:19:45,237 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 10:19:45,237 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 10:19:45,238 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 10:19:45,238 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 10:19:45,240 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 10:19:45,240 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 10:19:45,240 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 10:19:45,240 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 10:19:45,241 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 10:19:45,241 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 10:19:45,241 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 10:19:45,241 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 10:19:45,241 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 10:19:45,241 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 -> f49dce48b63f0ee8eed4ac47c25c384a83e3c23200b58c130c184e2b953e32f3 [2024-11-19 10:19:45,422 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 10:19:45,445 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 10:19:45,448 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 10:19:45,448 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 10:19:45,449 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 10:19:45,450 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/c.01-no-inv-alloca.i [2024-11-19 10:19:46,702 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 10:19:46,859 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 10:19:46,860 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/c.01-no-inv-alloca.i [2024-11-19 10:19:46,868 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66f5284c8/5faf45e3ef894867b816be6039b935fb/FLAG3ad66d8a1 [2024-11-19 10:19:46,878 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66f5284c8/5faf45e3ef894867b816be6039b935fb [2024-11-19 10:19:46,881 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 10:19:46,882 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 10:19:46,882 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 10:19:46,883 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 10:19:46,887 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 10:19:46,887 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:19:46" (1/1) ... [2024-11-19 10:19:46,889 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@294d5eb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:19:46, skipping insertion in model container [2024-11-19 10:19:46,890 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:19:46" (1/1) ... [2024-11-19 10:19:46,925 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 10:19:47,144 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 10:19:47,150 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 10:19:47,181 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 10:19:47,203 INFO L204 MainTranslator]: Completed translation [2024-11-19 10:19:47,203 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:19:47 WrapperNode [2024-11-19 10:19:47,204 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 10:19:47,204 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 10:19:47,204 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 10:19:47,205 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 10:19:47,210 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:19:47" (1/1) ... [2024-11-19 10:19:47,220 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:19:47" (1/1) ... [2024-11-19 10:19:47,235 INFO L138 Inliner]: procedures = 111, calls = 25, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 82 [2024-11-19 10:19:47,236 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 10:19:47,236 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 10:19:47,236 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 10:19:47,237 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 10:19:47,244 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:19:47" (1/1) ... [2024-11-19 10:19:47,244 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:19:47" (1/1) ... [2024-11-19 10:19:47,246 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:19:47" (1/1) ... [2024-11-19 10:19:47,258 INFO L175 MemorySlicer]: Split 13 memory accesses to 3 slices as follows [2, 6, 5]. 46 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0, 0]. The 6 writes are split as follows [1, 3, 2]. [2024-11-19 10:19:47,258 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:19:47" (1/1) ... [2024-11-19 10:19:47,259 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:19:47" (1/1) ... [2024-11-19 10:19:47,267 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:19:47" (1/1) ... [2024-11-19 10:19:47,269 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:19:47" (1/1) ... [2024-11-19 10:19:47,272 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:19:47" (1/1) ... [2024-11-19 10:19:47,273 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:19:47" (1/1) ... [2024-11-19 10:19:47,275 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 10:19:47,277 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 10:19:47,281 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 10:19:47,281 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 10:19:47,282 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:19:47" (1/1) ... [2024-11-19 10:19:47,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 10:19:47,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:19:47,310 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-19 10:19:47,312 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-19 10:19:47,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 10:19:47,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 10:19:47,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-19 10:19:47,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 10:19:47,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 10:19:47,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-19 10:19:47,351 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 10:19:47,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 10:19:47,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 10:19:47,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 10:19:47,445 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 10:19:47,447 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 10:19:47,566 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-11-19 10:19:47,568 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 10:19:47,581 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 10:19:47,581 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-19 10:19:47,582 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:19:47 BoogieIcfgContainer [2024-11-19 10:19:47,582 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 10:19:47,584 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 10:19:47,585 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 10:19:47,587 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 10:19:47,588 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 10:19:46" (1/3) ... [2024-11-19 10:19:47,589 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bf991e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:19:47, skipping insertion in model container [2024-11-19 10:19:47,589 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:19:47" (2/3) ... [2024-11-19 10:19:47,589 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bf991e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:19:47, skipping insertion in model container [2024-11-19 10:19:47,589 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:19:47" (3/3) ... [2024-11-19 10:19:47,590 INFO L112 eAbstractionObserver]: Analyzing ICFG c.01-no-inv-alloca.i [2024-11-19 10:19:47,604 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 10:19:47,605 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-19 10:19:47,657 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 10:19:47,663 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;@5e337d04, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 10:19:47,663 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-19 10:19:47,667 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 16 states have (on average 1.5625) internal successors, (25), 20 states have internal predecessors, (25), 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-19 10:19:47,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-19 10:19:47,671 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:19:47,672 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:19:47,673 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-19 10:19:47,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:19:47,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1806924603, now seen corresponding path program 1 times [2024-11-19 10:19:47,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:19:47,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131604382] [2024-11-19 10:19:47,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:19:47,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:19:47,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:19:47,833 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-19 10:19:47,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:19:47,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131604382] [2024-11-19 10:19:47,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131604382] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:19:47,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:19:47,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 10:19:47,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525408360] [2024-11-19 10:19:47,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:19:47,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 10:19:47,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:19:47,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 10:19:47,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 10:19:47,865 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.5625) internal successors, (25), 20 states have internal predecessors, (25), 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 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-19 10:19:47,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:19:47,875 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2024-11-19 10:19:47,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 10:19:47,876 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 7 [2024-11-19 10:19:47,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:19:47,881 INFO L225 Difference]: With dead ends: 40 [2024-11-19 10:19:47,881 INFO L226 Difference]: Without dead ends: 16 [2024-11-19 10:19:47,883 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-19 10:19:47,885 INFO L432 NwaCegarLoop]: 23 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, 23 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-19 10:19:47,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:19:47,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-11-19 10:19:47,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-11-19 10:19:47,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 12 states have (on average 1.5) internal successors, (18), 15 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-19 10:19:47,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2024-11-19 10:19:47,905 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 7 [2024-11-19 10:19:47,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:19:47,905 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2024-11-19 10:19:47,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-19 10:19:47,905 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2024-11-19 10:19:47,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-19 10:19:47,906 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:19:47,906 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:19:47,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 10:19:47,906 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-19 10:19:47,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:19:47,907 INFO L85 PathProgramCache]: Analyzing trace with hash 179565772, now seen corresponding path program 1 times [2024-11-19 10:19:47,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:19:47,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285302706] [2024-11-19 10:19:47,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:19:47,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:19:47,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:19:48,173 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-19 10:19:48,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:19:48,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285302706] [2024-11-19 10:19:48,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285302706] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:19:48,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:19:48,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 10:19:48,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974148531] [2024-11-19 10:19:48,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:19:48,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 10:19:48,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:19:48,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 10:19:48,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 10:19:48,176 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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-19 10:19:48,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:19:48,244 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2024-11-19 10:19:48,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 10:19:48,244 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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 8 [2024-11-19 10:19:48,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:19:48,245 INFO L225 Difference]: With dead ends: 31 [2024-11-19 10:19:48,245 INFO L226 Difference]: Without dead ends: 30 [2024-11-19 10:19:48,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-19 10:19:48,246 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 38 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:19:48,247 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 33 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:19:48,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-19 10:19:48,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 15. [2024-11-19 10:19:48,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 14 states have internal predecessors, (17), 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-19 10:19:48,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2024-11-19 10:19:48,251 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 8 [2024-11-19 10:19:48,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:19:48,251 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2024-11-19 10:19:48,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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-19 10:19:48,251 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2024-11-19 10:19:48,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-19 10:19:48,252 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:19:48,252 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:19:48,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 10:19:48,252 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-19 10:19:48,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:19:48,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1271569968, now seen corresponding path program 1 times [2024-11-19 10:19:48,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:19:48,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478292926] [2024-11-19 10:19:48,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:19:48,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:19:48,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:19:48,385 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-19 10:19:48,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:19:48,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478292926] [2024-11-19 10:19:48,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478292926] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:19:48,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:19:48,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 10:19:48,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702557266] [2024-11-19 10:19:48,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:19:48,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 10:19:48,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:19:48,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 10:19:48,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 10:19:48,390 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 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-19 10:19:48,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:19:48,427 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2024-11-19 10:19:48,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:19:48,428 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 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-19 10:19:48,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:19:48,429 INFO L225 Difference]: With dead ends: 42 [2024-11-19 10:19:48,429 INFO L226 Difference]: Without dead ends: 29 [2024-11-19 10:19:48,430 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-19 10:19:48,431 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 14 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:19:48,432 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 47 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:19:48,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-19 10:19:48,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 18. [2024-11-19 10:19:48,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 15 states have (on average 1.4) internal successors, (21), 17 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-19 10:19:48,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2024-11-19 10:19:48,436 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 9 [2024-11-19 10:19:48,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:19:48,436 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2024-11-19 10:19:48,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 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-19 10:19:48,437 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2024-11-19 10:19:48,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-19 10:19:48,437 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:19:48,437 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:19:48,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 10:19:48,440 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-19 10:19:48,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:19:48,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1271571698, now seen corresponding path program 1 times [2024-11-19 10:19:48,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:19:48,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059324748] [2024-11-19 10:19:48,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:19:48,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:19:48,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:19:48,502 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-19 10:19:48,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:19:48,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059324748] [2024-11-19 10:19:48,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059324748] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:19:48,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:19:48,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:19:48,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509971546] [2024-11-19 10:19:48,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:19:48,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:19:48,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:19:48,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:19:48,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:19:48,505 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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-19 10:19:48,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:19:48,539 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2024-11-19 10:19:48,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:19:48,540 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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-19 10:19:48,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:19:48,541 INFO L225 Difference]: With dead ends: 29 [2024-11-19 10:19:48,541 INFO L226 Difference]: Without dead ends: 28 [2024-11-19 10:19:48,541 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 10:19:48,542 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 10 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:19:48,545 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 35 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:19:48,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-19 10:19:48,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 21. [2024-11-19 10:19:48,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 20 states have internal predecessors, (25), 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-19 10:19:48,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2024-11-19 10:19:48,549 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 9 [2024-11-19 10:19:48,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:19:48,549 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2024-11-19 10:19:48,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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-19 10:19:48,549 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2024-11-19 10:19:48,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-19 10:19:48,549 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:19:48,549 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:19:48,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 10:19:48,549 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-19 10:19:48,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:19:48,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1271629550, now seen corresponding path program 1 times [2024-11-19 10:19:48,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:19:48,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752763581] [2024-11-19 10:19:48,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:19:48,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:19:48,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:19:48,656 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-19 10:19:48,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:19:48,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752763581] [2024-11-19 10:19:48,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752763581] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:19:48,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:19:48,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 10:19:48,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186015061] [2024-11-19 10:19:48,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:19:48,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 10:19:48,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:19:48,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 10:19:48,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 10:19:48,660 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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-19 10:19:48,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:19:48,686 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2024-11-19 10:19:48,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 10:19:48,687 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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-19 10:19:48,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:19:48,687 INFO L225 Difference]: With dead ends: 21 [2024-11-19 10:19:48,687 INFO L226 Difference]: Without dead ends: 20 [2024-11-19 10:19:48,688 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 10:19:48,688 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 9 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:19:48,689 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 28 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:19:48,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-19 10:19:48,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-11-19 10:19:48,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 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-19 10:19:48,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2024-11-19 10:19:48,691 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 9 [2024-11-19 10:19:48,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:19:48,692 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2024-11-19 10:19:48,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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-19 10:19:48,692 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2024-11-19 10:19:48,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-19 10:19:48,692 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:19:48,692 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:19:48,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 10:19:48,693 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-19 10:19:48,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:19:48,693 INFO L85 PathProgramCache]: Analyzing trace with hash 765810456, now seen corresponding path program 1 times [2024-11-19 10:19:48,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:19:48,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910774954] [2024-11-19 10:19:48,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:19:48,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:19:48,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:19:48,839 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-19 10:19:48,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:19:48,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910774954] [2024-11-19 10:19:48,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910774954] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:19:48,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:19:48,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 10:19:48,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642033043] [2024-11-19 10:19:48,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:19:48,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 10:19:48,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:19:48,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 10:19:48,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 10:19:48,842 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 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-19 10:19:48,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:19:48,941 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2024-11-19 10:19:48,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 10:19:48,941 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 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-19 10:19:48,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:19:48,941 INFO L225 Difference]: With dead ends: 42 [2024-11-19 10:19:48,942 INFO L226 Difference]: Without dead ends: 41 [2024-11-19 10:19:48,942 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2024-11-19 10:19:48,943 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 27 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:19:48,943 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 58 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:19:48,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-19 10:19:48,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 35. [2024-11-19 10:19:48,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 33 states have (on average 1.303030303030303) internal successors, (43), 34 states have internal predecessors, (43), 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-19 10:19:48,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2024-11-19 10:19:48,947 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 10 [2024-11-19 10:19:48,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:19:48,947 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2024-11-19 10:19:48,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 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-19 10:19:48,947 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2024-11-19 10:19:48,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-19 10:19:48,948 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:19:48,948 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-19 10:19:48,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 10:19:48,948 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-19 10:19:48,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:19:48,949 INFO L85 PathProgramCache]: Analyzing trace with hash -52523321, now seen corresponding path program 1 times [2024-11-19 10:19:48,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:19:48,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25997592] [2024-11-19 10:19:48,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:19:48,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:19:48,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:19:49,034 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:19:49,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:19:49,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25997592] [2024-11-19 10:19:49,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25997592] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:19:49,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [682467204] [2024-11-19 10:19:49,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:19:49,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:19:49,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:19:49,036 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 10:19:49,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 10:19:49,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:19:49,099 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 10:19:49,103 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:19:49,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-19 10:19:49,184 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 10:19:49,185 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 10:19:49,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [682467204] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:19:49,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 10:19:49,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-11-19 10:19:49,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961743472] [2024-11-19 10:19:49,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:19:49,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:19:49,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:19:49,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:19:49,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-19 10:19:49,187 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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-19 10:19:49,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:19:49,207 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2024-11-19 10:19:49,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:19:49,208 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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-19 10:19:49,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:19:49,208 INFO L225 Difference]: With dead ends: 35 [2024-11-19 10:19:49,208 INFO L226 Difference]: Without dead ends: 18 [2024-11-19 10:19:49,209 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-19 10:19:49,209 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:19:49,209 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 25 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:19:49,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-11-19 10:19:49,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2024-11-19 10:19:49,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 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-19 10:19:49,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2024-11-19 10:19:49,211 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 14 [2024-11-19 10:19:49,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:19:49,212 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2024-11-19 10:19:49,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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-19 10:19:49,212 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2024-11-19 10:19:49,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-19 10:19:49,212 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:19:49,212 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:19:49,227 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 10:19:49,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:19:49,415 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-19 10:19:49,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:19:49,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1628276511, now seen corresponding path program 1 times [2024-11-19 10:19:49,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:19:49,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097318006] [2024-11-19 10:19:49,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:19:49,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:19:49,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:19:49,541 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:19:49,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:19:49,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097318006] [2024-11-19 10:19:49,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097318006] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:19:49,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2034199360] [2024-11-19 10:19:49,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:19:49,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:19:49,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:19:49,544 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 10:19:49,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 10:19:49,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:19:49,625 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 10:19:49,626 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:19:49,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 10:19:49,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-19 10:19:49,685 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 10:19:49,686 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 10:19:49,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2034199360] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:19:49,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 10:19:49,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2024-11-19 10:19:49,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568425283] [2024-11-19 10:19:49,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:19:49,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:19:49,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:19:49,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:19:49,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-19 10:19:49,688 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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-19 10:19:49,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:19:49,708 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2024-11-19 10:19:49,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:19:49,709 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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 15 [2024-11-19 10:19:49,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:19:49,710 INFO L225 Difference]: With dead ends: 16 [2024-11-19 10:19:49,710 INFO L226 Difference]: Without dead ends: 0 [2024-11-19 10:19:49,710 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-19 10:19:49,710 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 3 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 18 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-11-19 10:19:49,711 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 18 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:19:49,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-19 10:19:49,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-19 10:19:49,711 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-19 10:19:49,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-19 10:19:49,711 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2024-11-19 10:19:49,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:19:49,711 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 10:19:49,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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-19 10:19:49,711 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-19 10:19:49,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-19 10:19:49,718 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-11-19 10:19:49,718 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-11-19 10:19:49,718 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-11-19 10:19:49,718 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-11-19 10:19:49,734 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-19 10:19:49,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-19 10:19:49,925 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:19:49,927 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-19 10:19:49,968 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 10:19:49,978 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-19 10:19:49,979 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-19 10:19:49,979 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~y_ref~0!base,]]] [2024-11-19 10:19:49,979 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-11-19 10:19:49,979 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-11-19 10:19:49,979 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] [2024-11-19 10:19:49,979 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-11-19 10:19:49,979 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-11-19 10:19:49,979 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] [2024-11-19 10:19:49,980 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-11-19 10:19:49,980 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-11-19 10:19:49,980 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] [2024-11-19 10:19:49,981 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 10:19:49 BoogieIcfgContainer [2024-11-19 10:19:49,981 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 10:19:49,982 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 10:19:49,982 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 10:19:49,982 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 10:19:49,982 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:19:47" (3/4) ... [2024-11-19 10:19:49,984 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-19 10:19:49,990 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2024-11-19 10:19:49,990 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-19 10:19:49,990 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-19 10:19:49,990 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-19 10:19:50,065 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 10:19:50,068 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-19 10:19:50,069 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 10:19:50,069 INFO L158 Benchmark]: Toolchain (without parser) took 3187.33ms. Allocated memory was 172.0MB in the beginning and 213.9MB in the end (delta: 41.9MB). Free memory was 139.1MB in the beginning and 126.4MB in the end (delta: 12.7MB). Peak memory consumption was 52.7MB. Max. memory is 16.1GB. [2024-11-19 10:19:50,069 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 121.6MB. Free memory is still 81.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 10:19:50,069 INFO L158 Benchmark]: CACSL2BoogieTranslator took 321.37ms. Allocated memory is still 172.0MB. Free memory was 139.1MB in the beginning and 119.3MB in the end (delta: 19.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-19 10:19:50,069 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.55ms. Allocated memory is still 172.0MB. Free memory was 119.3MB in the beginning and 117.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 10:19:50,070 INFO L158 Benchmark]: Boogie Preprocessor took 38.25ms. Allocated memory is still 172.0MB. Free memory was 117.2MB in the beginning and 115.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 10:19:50,070 INFO L158 Benchmark]: RCFGBuilder took 304.59ms. Allocated memory is still 172.0MB. Free memory was 115.1MB in the beginning and 102.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-19 10:19:50,070 INFO L158 Benchmark]: TraceAbstraction took 2396.90ms. Allocated memory was 172.0MB in the beginning and 213.9MB in the end (delta: 41.9MB). Free memory was 101.5MB in the beginning and 130.6MB in the end (delta: -29.1MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. [2024-11-19 10:19:50,070 INFO L158 Benchmark]: Witness Printer took 86.87ms. Allocated memory is still 213.9MB. Free memory was 130.6MB in the beginning and 126.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 10:19:50,071 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.15ms. Allocated memory is still 121.6MB. Free memory is still 81.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 321.37ms. Allocated memory is still 172.0MB. Free memory was 139.1MB in the beginning and 119.3MB in the end (delta: 19.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.55ms. Allocated memory is still 172.0MB. Free memory was 119.3MB in the beginning and 117.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.25ms. Allocated memory is still 172.0MB. Free memory was 117.2MB in the beginning and 115.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 304.59ms. Allocated memory is still 172.0MB. Free memory was 115.1MB in the beginning and 102.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 2396.90ms. Allocated memory was 172.0MB in the beginning and 213.9MB in the end (delta: 41.9MB). Free memory was 101.5MB in the beginning and 130.6MB in the end (delta: -29.1MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. * Witness Printer took 86.87ms. Allocated memory is still 213.9MB. Free memory was 130.6MB in the beginning and 126.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~y_ref~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] * 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: 558]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 558]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 560]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 560]: 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, 21 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 2.3s, OverallIterations: 8, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 102 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 102 mSDsluCounter, 267 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 164 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 188 IncrementalHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 103 mSDtfsCounter, 188 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred in iteration=6, InterpolantAutomatonStates: 40, 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, 8 MinimizatonAttempts, 41 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 110 NumberOfCodeBlocks, 110 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 100 ConstructedInterpolants, 0 QuantifiedInterpolants, 383 SizeOfPredicates, 6 NumberOfNonLiveVariables, 224 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 10 InterpolantComputations, 8 PerfectInterpolantSequences, 8/16 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 - InvariantResult [Line: 557]: Loop Invariant Derived loop invariant: null - InvariantResult [Line: 555]: Loop Invariant Derived loop invariant: null RESULT: Ultimate proved your program to be correct! [2024-11-19 10:19:50,096 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