./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_1-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_1-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash db53fe9124e215e75c7f288cadf12df33daef67c04c75ea6ca77bc804670a99c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 12:55:02,220 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 12:55:02,299 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-13 12:55:02,303 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 12:55:02,303 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 12:55:02,332 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 12:55:02,334 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 12:55:02,335 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 12:55:02,336 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 12:55:02,337 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 12:55:02,337 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 12:55:02,337 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 12:55:02,338 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 12:55:02,338 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 12:55:02,341 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 12:55:02,341 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 12:55:02,341 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 12:55:02,342 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 12:55:02,342 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 12:55:02,342 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 12:55:02,342 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 12:55:02,346 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 12:55:02,347 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 12:55:02,347 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 12:55:02,347 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 12:55:02,347 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-13 12:55:02,347 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 12:55:02,348 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 12:55:02,348 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 12:55:02,348 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 12:55:02,348 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 12:55:02,348 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 12:55:02,349 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 12:55:02,349 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 12:55:02,349 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:55:02,349 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 12:55:02,350 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 12:55:02,350 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 12:55:02,350 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 12:55:02,352 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 12:55:02,353 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 12:55:02,353 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 12:55:02,353 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 12:55:02,353 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 12:55:02,353 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> db53fe9124e215e75c7f288cadf12df33daef67c04c75ea6ca77bc804670a99c [2024-10-13 12:55:02,612 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 12:55:02,634 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 12:55:02,638 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 12:55:02,639 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 12:55:02,640 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 12:55:02,641 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_1-2.i [2024-10-13 12:55:04,094 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 12:55:04,270 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 12:55:04,271 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_1-2.i [2024-10-13 12:55:04,279 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06ec99321/134527261f1e44f29382ddfd6f436645/FLAGec0f23a93 [2024-10-13 12:55:04,292 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06ec99321/134527261f1e44f29382ddfd6f436645 [2024-10-13 12:55:04,294 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 12:55:04,295 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 12:55:04,296 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 12:55:04,296 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 12:55:04,302 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 12:55:04,303 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:55:04" (1/1) ... [2024-10-13 12:55:04,305 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5147a064 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:55:04, skipping insertion in model container [2024-10-13 12:55:04,306 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:55:04" (1/1) ... [2024-10-13 12:55:04,329 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 12:55:04,606 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:55:04,614 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 12:55:04,648 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:55:04,661 INFO L204 MainTranslator]: Completed translation [2024-10-13 12:55:04,662 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:55:04 WrapperNode [2024-10-13 12:55:04,662 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 12:55:04,663 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 12:55:04,663 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 12:55:04,663 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 12:55:04,670 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:55:04" (1/1) ... [2024-10-13 12:55:04,682 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:55:04" (1/1) ... [2024-10-13 12:55:04,724 INFO L138 Inliner]: procedures = 16, calls = 9, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 190 [2024-10-13 12:55:04,724 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 12:55:04,725 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 12:55:04,725 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 12:55:04,725 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 12:55:04,740 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:55:04" (1/1) ... [2024-10-13 12:55:04,741 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:55:04" (1/1) ... [2024-10-13 12:55:04,747 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:55:04" (1/1) ... [2024-10-13 12:55:04,763 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 12:55:04,763 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:55:04" (1/1) ... [2024-10-13 12:55:04,764 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:55:04" (1/1) ... [2024-10-13 12:55:04,772 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:55:04" (1/1) ... [2024-10-13 12:55:04,776 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:55:04" (1/1) ... [2024-10-13 12:55:04,779 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:55:04" (1/1) ... [2024-10-13 12:55:04,782 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:55:04" (1/1) ... [2024-10-13 12:55:04,786 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 12:55:04,787 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 12:55:04,787 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 12:55:04,787 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 12:55:04,788 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:55:04" (1/1) ... [2024-10-13 12:55:04,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:55:04,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:55:04,825 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 12:55:04,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 12:55:04,868 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 12:55:04,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 12:55:04,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 12:55:04,869 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 12:55:04,928 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 12:55:04,930 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 12:55:05,338 INFO L? ?]: Removed 38 outVars from TransFormulas that were not future-live. [2024-10-13 12:55:05,338 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 12:55:05,382 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 12:55:05,383 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-13 12:55:05,384 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:55:05 BoogieIcfgContainer [2024-10-13 12:55:05,384 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 12:55:05,387 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 12:55:05,387 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 12:55:05,390 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 12:55:05,391 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:55:04" (1/3) ... [2024-10-13 12:55:05,391 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49bdd774 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:55:05, skipping insertion in model container [2024-10-13 12:55:05,391 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:55:04" (2/3) ... [2024-10-13 12:55:05,392 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49bdd774 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:55:05, skipping insertion in model container [2024-10-13 12:55:05,393 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:55:05" (3/3) ... [2024-10-13 12:55:05,395 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add_1-2.i [2024-10-13 12:55:05,412 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 12:55:05,412 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 41 error locations. [2024-10-13 12:55:05,475 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 12:55:05,481 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;@15a79e49, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 12:55:05,481 INFO L334 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2024-10-13 12:55:05,485 INFO L276 IsEmpty]: Start isEmpty. Operand has 127 states, 85 states have (on average 1.9176470588235295) internal successors, (163), 126 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:55:05,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-13 12:55:05,490 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:55:05,490 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-13 12:55:05,491 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-10-13 12:55:05,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:55:05,496 INFO L85 PathProgramCache]: Analyzing trace with hash 340355, now seen corresponding path program 1 times [2024-10-13 12:55:05,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:55:05,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631288118] [2024-10-13 12:55:05,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:55:05,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:55:05,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:05,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:55:05,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:55:05,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631288118] [2024-10-13 12:55:05,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631288118] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:55:05,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:55:05,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 12:55:05,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188317183] [2024-10-13 12:55:05,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:55:05,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 12:55:05,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:55:05,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 12:55:05,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 12:55:05,687 INFO L87 Difference]: Start difference. First operand has 127 states, 85 states have (on average 1.9176470588235295) internal successors, (163), 126 states have internal predecessors, (163), 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, 1 states have (on average 3.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:55:05,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:55:05,736 INFO L93 Difference]: Finished difference Result 158 states and 217 transitions. [2024-10-13 12:55:05,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 12:55:05,739 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 3.0) internal successors, (3), 2 states have internal predecessors, (3), 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 3 [2024-10-13 12:55:05,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:55:05,751 INFO L225 Difference]: With dead ends: 158 [2024-10-13 12:55:05,751 INFO L226 Difference]: Without dead ends: 78 [2024-10-13 12:55:05,754 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 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-10-13 12:55:05,758 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 12:55:05,761 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 114 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 12:55:05,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-13 12:55:05,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-10-13 12:55:05,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 1.4025974025974026) internal successors, (108), 77 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:55:05,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 108 transitions. [2024-10-13 12:55:05,802 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 108 transitions. Word has length 3 [2024-10-13 12:55:05,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:55:05,802 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 108 transitions. [2024-10-13 12:55:05,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 3.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:55:05,803 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 108 transitions. [2024-10-13 12:55:05,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-13 12:55:05,804 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:55:05,804 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:55:05,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 12:55:05,805 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-10-13 12:55:05,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:55:05,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1455248417, now seen corresponding path program 1 times [2024-10-13 12:55:05,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:55:05,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783095727] [2024-10-13 12:55:05,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:55:05,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:55:05,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:06,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:55:06,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:55:06,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783095727] [2024-10-13 12:55:06,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783095727] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:55:06,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:55:06,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:55:06,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616337716] [2024-10-13 12:55:06,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:55:06,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:55:06,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:55:06,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:55:06,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:55:06,031 INFO L87 Difference]: Start difference. First operand 78 states and 108 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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-10-13 12:55:06,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:55:06,158 INFO L93 Difference]: Finished difference Result 164 states and 239 transitions. [2024-10-13 12:55:06,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:55:06,158 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 18 [2024-10-13 12:55:06,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:55:06,160 INFO L225 Difference]: With dead ends: 164 [2024-10-13 12:55:06,160 INFO L226 Difference]: Without dead ends: 107 [2024-10-13 12:55:06,160 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:55:06,161 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 30 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 12:55:06,162 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 146 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 12:55:06,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-10-13 12:55:06,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 103. [2024-10-13 12:55:06,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 102 states have (on average 1.3431372549019607) internal successors, (137), 102 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:55:06,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 137 transitions. [2024-10-13 12:55:06,176 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 137 transitions. Word has length 18 [2024-10-13 12:55:06,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:55:06,176 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 137 transitions. [2024-10-13 12:55:06,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:55:06,177 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 137 transitions. [2024-10-13 12:55:06,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-13 12:55:06,178 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:55:06,178 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:55:06,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 12:55:06,178 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-10-13 12:55:06,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:55:06,179 INFO L85 PathProgramCache]: Analyzing trace with hash 523859999, now seen corresponding path program 1 times [2024-10-13 12:55:06,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:55:06,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030428247] [2024-10-13 12:55:06,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:55:06,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:55:06,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:06,356 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:55:06,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:55:06,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030428247] [2024-10-13 12:55:06,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030428247] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:55:06,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:55:06,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:55:06,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957473440] [2024-10-13 12:55:06,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:55:06,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:55:06,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:55:06,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:55:06,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:55:06,360 INFO L87 Difference]: Start difference. First operand 103 states and 137 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 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-10-13 12:55:06,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:55:06,606 INFO L93 Difference]: Finished difference Result 233 states and 344 transitions. [2024-10-13 12:55:06,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 12:55:06,607 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 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) Word has length 25 [2024-10-13 12:55:06,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:55:06,609 INFO L225 Difference]: With dead ends: 233 [2024-10-13 12:55:06,609 INFO L226 Difference]: Without dead ends: 176 [2024-10-13 12:55:06,609 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-10-13 12:55:06,612 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 114 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 12:55:06,613 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 201 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 12:55:06,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-10-13 12:55:06,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 128. [2024-10-13 12:55:06,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 127 states have (on average 1.3700787401574803) internal successors, (174), 127 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:55:06,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 174 transitions. [2024-10-13 12:55:06,631 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 174 transitions. Word has length 25 [2024-10-13 12:55:06,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:55:06,632 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 174 transitions. [2024-10-13 12:55:06,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 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-10-13 12:55:06,632 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 174 transitions. [2024-10-13 12:55:06,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-13 12:55:06,633 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:55:06,633 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:55:06,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 12:55:06,634 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-10-13 12:55:06,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:55:06,634 INFO L85 PathProgramCache]: Analyzing trace with hash 2019585051, now seen corresponding path program 1 times [2024-10-13 12:55:06,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:55:06,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266099878] [2024-10-13 12:55:06,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:55:06,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:55:06,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:06,800 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-13 12:55:06,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:55:06,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266099878] [2024-10-13 12:55:06,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266099878] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:55:06,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:55:06,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:55:06,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456886310] [2024-10-13 12:55:06,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:55:06,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:55:06,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:55:06,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:55:06,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:55:06,805 INFO L87 Difference]: Start difference. First operand 128 states and 174 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:55:06,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:55:06,971 INFO L93 Difference]: Finished difference Result 334 states and 453 transitions. [2024-10-13 12:55:06,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:55:06,972 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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 32 [2024-10-13 12:55:06,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:55:06,973 INFO L225 Difference]: With dead ends: 334 [2024-10-13 12:55:06,974 INFO L226 Difference]: Without dead ends: 230 [2024-10-13 12:55:06,974 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-10-13 12:55:06,979 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 110 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 12:55:06,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 306 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 12:55:06,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2024-10-13 12:55:06,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 141. [2024-10-13 12:55:06,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 140 states have (on average 1.3571428571428572) internal successors, (190), 140 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:55:07,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 190 transitions. [2024-10-13 12:55:07,001 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 190 transitions. Word has length 32 [2024-10-13 12:55:07,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:55:07,001 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 190 transitions. [2024-10-13 12:55:07,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:55:07,002 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 190 transitions. [2024-10-13 12:55:07,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-13 12:55:07,003 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:55:07,003 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:55:07,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 12:55:07,004 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-10-13 12:55:07,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:55:07,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1965153963, now seen corresponding path program 1 times [2024-10-13 12:55:07,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:55:07,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413879388] [2024-10-13 12:55:07,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:55:07,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:55:07,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:07,165 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-13 12:55:07,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:55:07,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413879388] [2024-10-13 12:55:07,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413879388] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:55:07,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:55:07,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:55:07,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419814529] [2024-10-13 12:55:07,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:55:07,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:55:07,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:55:07,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:55:07,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:55:07,171 INFO L87 Difference]: Start difference. First operand 141 states and 190 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:55:07,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:55:07,330 INFO L93 Difference]: Finished difference Result 340 states and 459 transitions. [2024-10-13 12:55:07,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:55:07,331 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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 35 [2024-10-13 12:55:07,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:55:07,333 INFO L225 Difference]: With dead ends: 340 [2024-10-13 12:55:07,333 INFO L226 Difference]: Without dead ends: 236 [2024-10-13 12:55:07,336 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-10-13 12:55:07,338 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 99 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 12:55:07,341 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 296 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 12:55:07,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-10-13 12:55:07,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 154. [2024-10-13 12:55:07,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 153 states have (on average 1.3333333333333333) internal successors, (204), 153 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:55:07,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 204 transitions. [2024-10-13 12:55:07,363 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 204 transitions. Word has length 35 [2024-10-13 12:55:07,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:55:07,364 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 204 transitions. [2024-10-13 12:55:07,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:55:07,364 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 204 transitions. [2024-10-13 12:55:07,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-13 12:55:07,365 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:55:07,366 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:55:07,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 12:55:07,366 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-10-13 12:55:07,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:55:07,370 INFO L85 PathProgramCache]: Analyzing trace with hash 297615360, now seen corresponding path program 1 times [2024-10-13 12:55:07,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:55:07,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803045380] [2024-10-13 12:55:07,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:55:07,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:55:07,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:07,485 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:55:07,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:55:07,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803045380] [2024-10-13 12:55:07,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803045380] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 12:55:07,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2104069610] [2024-10-13 12:55:07,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:55:07,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:55:07,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:55:07,490 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-10-13 12:55:07,493 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-10-13 12:55:07,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:07,546 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 12:55:07,551 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:55:07,623 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 12:55:07,626 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:55:07,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2104069610] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:55:07,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 12:55:07,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2024-10-13 12:55:07,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652759489] [2024-10-13 12:55:07,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:55:07,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:55:07,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:55:07,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:55:07,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-13 12:55:07,628 INFO L87 Difference]: Start difference. First operand 154 states and 204 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:55:07,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:55:07,812 INFO L93 Difference]: Finished difference Result 309 states and 438 transitions. [2024-10-13 12:55:07,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:55:07,817 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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 38 [2024-10-13 12:55:07,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:55:07,818 INFO L225 Difference]: With dead ends: 309 [2024-10-13 12:55:07,818 INFO L226 Difference]: Without dead ends: 207 [2024-10-13 12:55:07,819 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-13 12:55:07,820 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 48 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 12:55:07,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 243 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 12:55:07,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2024-10-13 12:55:07,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 185. [2024-10-13 12:55:07,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 184 states have (on average 1.309782608695652) internal successors, (241), 184 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:55:07,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 241 transitions. [2024-10-13 12:55:07,836 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 241 transitions. Word has length 38 [2024-10-13 12:55:07,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:55:07,837 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 241 transitions. [2024-10-13 12:55:07,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:55:07,837 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 241 transitions. [2024-10-13 12:55:07,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-13 12:55:07,842 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:55:07,842 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:55:07,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-13 12:55:08,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-13 12:55:08,043 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-10-13 12:55:08,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:55:08,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1903637854, now seen corresponding path program 1 times [2024-10-13 12:55:08,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:55:08,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222479047] [2024-10-13 12:55:08,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:55:08,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:55:08,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:08,212 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:55:08,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:55:08,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222479047] [2024-10-13 12:55:08,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222479047] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 12:55:08,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [918620345] [2024-10-13 12:55:08,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:55:08,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:55:08,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:55:08,216 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-10-13 12:55:08,219 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-10-13 12:55:08,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:08,275 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 12:55:08,277 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:55:08,319 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-13 12:55:08,319 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:55:08,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [918620345] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:55:08,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 12:55:08,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2024-10-13 12:55:08,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247296004] [2024-10-13 12:55:08,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:55:08,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:55:08,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:55:08,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:55:08,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-13 12:55:08,322 INFO L87 Difference]: Start difference. First operand 185 states and 241 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:55:08,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:55:08,487 INFO L93 Difference]: Finished difference Result 371 states and 506 transitions. [2024-10-13 12:55:08,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:55:08,487 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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 45 [2024-10-13 12:55:08,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:55:08,489 INFO L225 Difference]: With dead ends: 371 [2024-10-13 12:55:08,489 INFO L226 Difference]: Without dead ends: 238 [2024-10-13 12:55:08,489 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-13 12:55:08,491 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 47 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 12:55:08,491 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 243 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 12:55:08,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-10-13 12:55:08,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 210. [2024-10-13 12:55:08,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 209 states have (on average 1.291866028708134) internal successors, (270), 209 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:55:08,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 270 transitions. [2024-10-13 12:55:08,505 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 270 transitions. Word has length 45 [2024-10-13 12:55:08,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:55:08,506 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 270 transitions. [2024-10-13 12:55:08,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:55:08,506 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 270 transitions. [2024-10-13 12:55:08,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-13 12:55:08,507 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:55:08,508 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:55:08,524 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 12:55:08,708 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,SelfDestructingSolverStorable6 [2024-10-13 12:55:08,709 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-10-13 12:55:08,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:55:08,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1403715964, now seen corresponding path program 1 times [2024-10-13 12:55:08,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:55:08,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180609182] [2024-10-13 12:55:08,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:55:08,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:55:08,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:08,775 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-13 12:55:08,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:55:08,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180609182] [2024-10-13 12:55:08,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180609182] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:55:08,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:55:08,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:55:08,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815307871] [2024-10-13 12:55:08,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:55:08,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:55:08,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:55:08,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:55:08,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:55:08,778 INFO L87 Difference]: Start difference. First operand 210 states and 270 transitions. Second operand has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:55:08,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:55:08,789 INFO L93 Difference]: Finished difference Result 257 states and 327 transitions. [2024-10-13 12:55:08,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:55:08,790 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 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 52 [2024-10-13 12:55:08,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:55:08,791 INFO L225 Difference]: With dead ends: 257 [2024-10-13 12:55:08,791 INFO L226 Difference]: Without dead ends: 184 [2024-10-13 12:55:08,792 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:55:08,792 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 16 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 12:55:08,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 222 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 12:55:08,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-10-13 12:55:08,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2024-10-13 12:55:08,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 183 states have (on average 1.278688524590164) internal successors, (234), 183 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:55:08,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 234 transitions. [2024-10-13 12:55:08,804 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 234 transitions. Word has length 52 [2024-10-13 12:55:08,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:55:08,805 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 234 transitions. [2024-10-13 12:55:08,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:55:08,805 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 234 transitions. [2024-10-13 12:55:08,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-13 12:55:08,810 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:55:08,810 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:55:08,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 12:55:08,811 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-10-13 12:55:08,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:55:08,811 INFO L85 PathProgramCache]: Analyzing trace with hash -627029240, now seen corresponding path program 1 times [2024-10-13 12:55:08,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:55:08,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795574975] [2024-10-13 12:55:08,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:55:08,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:55:08,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:09,003 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-10-13 12:55:09,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:55:09,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795574975] [2024-10-13 12:55:09,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795574975] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:55:09,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:55:09,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 12:55:09,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071783782] [2024-10-13 12:55:09,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:55:09,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 12:55:09,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:55:09,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 12:55:09,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:55:09,008 INFO L87 Difference]: Start difference. First operand 184 states and 234 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:55:09,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:55:09,165 INFO L93 Difference]: Finished difference Result 479 states and 611 transitions. [2024-10-13 12:55:09,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 12:55:09,165 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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 64 [2024-10-13 12:55:09,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:55:09,167 INFO L225 Difference]: With dead ends: 479 [2024-10-13 12:55:09,167 INFO L226 Difference]: Without dead ends: 345 [2024-10-13 12:55:09,167 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-13 12:55:09,169 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 123 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 12:55:09,170 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 234 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 12:55:09,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2024-10-13 12:55:09,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 226. [2024-10-13 12:55:09,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 225 states have (on average 1.2755555555555556) internal successors, (287), 225 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:55:09,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 287 transitions. [2024-10-13 12:55:09,181 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 287 transitions. Word has length 64 [2024-10-13 12:55:09,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:55:09,181 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 287 transitions. [2024-10-13 12:55:09,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:55:09,182 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 287 transitions. [2024-10-13 12:55:09,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-13 12:55:09,183 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:55:09,183 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:55:09,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 12:55:09,183 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-10-13 12:55:09,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:55:09,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1158574485, now seen corresponding path program 1 times [2024-10-13 12:55:09,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:55:09,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623010463] [2024-10-13 12:55:09,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:55:09,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:55:09,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:09,308 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-13 12:55:09,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:55:09,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623010463] [2024-10-13 12:55:09,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623010463] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:55:09,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:55:09,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:55:09,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755299485] [2024-10-13 12:55:09,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:55:09,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:55:09,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:55:09,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:55:09,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:55:09,310 INFO L87 Difference]: Start difference. First operand 226 states and 287 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:55:09,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:55:09,371 INFO L93 Difference]: Finished difference Result 512 states and 650 transitions. [2024-10-13 12:55:09,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:55:09,371 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 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 67 [2024-10-13 12:55:09,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:55:09,373 INFO L225 Difference]: With dead ends: 512 [2024-10-13 12:55:09,373 INFO L226 Difference]: Without dead ends: 336 [2024-10-13 12:55:09,373 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:55:09,374 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 68 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 12:55:09,374 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 383 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 12:55:09,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2024-10-13 12:55:09,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 248. [2024-10-13 12:55:09,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 247 states have (on average 1.2995951417004048) internal successors, (321), 247 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:55:09,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 321 transitions. [2024-10-13 12:55:09,382 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 321 transitions. Word has length 67 [2024-10-13 12:55:09,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:55:09,382 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 321 transitions. [2024-10-13 12:55:09,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:55:09,383 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 321 transitions. [2024-10-13 12:55:09,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-13 12:55:09,385 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:55:09,385 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:55:09,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 12:55:09,385 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-10-13 12:55:09,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:55:09,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1789913269, now seen corresponding path program 1 times [2024-10-13 12:55:09,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:55:09,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543444916] [2024-10-13 12:55:09,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:55:09,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:55:09,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:09,559 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-13 12:55:09,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:55:09,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543444916] [2024-10-13 12:55:09,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543444916] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:55:09,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:55:09,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 12:55:09,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086678468] [2024-10-13 12:55:09,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:55:09,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 12:55:09,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:55:09,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 12:55:09,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 12:55:09,561 INFO L87 Difference]: Start difference. First operand 248 states and 321 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:55:09,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:55:09,789 INFO L93 Difference]: Finished difference Result 684 states and 890 transitions. [2024-10-13 12:55:09,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 12:55:09,790 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 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 73 [2024-10-13 12:55:09,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:55:09,792 INFO L225 Difference]: With dead ends: 684 [2024-10-13 12:55:09,792 INFO L226 Difference]: Without dead ends: 481 [2024-10-13 12:55:09,793 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-10-13 12:55:09,793 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 117 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 12:55:09,794 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 357 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 12:55:09,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2024-10-13 12:55:09,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 406. [2024-10-13 12:55:09,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 405 states have (on average 1.2864197530864196) internal successors, (521), 405 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:55:09,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 521 transitions. [2024-10-13 12:55:09,807 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 521 transitions. Word has length 73 [2024-10-13 12:55:09,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:55:09,808 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 521 transitions. [2024-10-13 12:55:09,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:55:09,808 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 521 transitions. [2024-10-13 12:55:09,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-13 12:55:09,809 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:55:09,809 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:55:09,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 12:55:09,810 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-10-13 12:55:09,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:55:09,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1765087641, now seen corresponding path program 1 times [2024-10-13 12:55:09,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:55:09,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453551920] [2024-10-13 12:55:09,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:55:09,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:55:09,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:09,896 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 46 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-13 12:55:09,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:55:09,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453551920] [2024-10-13 12:55:09,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453551920] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 12:55:09,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [673345728] [2024-10-13 12:55:09,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:55:09,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:55:09,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:55:09,899 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 12:55:09,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-13 12:55:09,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:09,961 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 12:55:09,963 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:55:10,035 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-13 12:55:10,035 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:55:10,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [673345728] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:55:10,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 12:55:10,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2024-10-13 12:55:10,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392627104] [2024-10-13 12:55:10,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:55:10,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:55:10,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:55:10,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:55:10,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:55:10,036 INFO L87 Difference]: Start difference. First operand 406 states and 521 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:55:10,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:55:10,133 INFO L93 Difference]: Finished difference Result 1046 states and 1340 transitions. [2024-10-13 12:55:10,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:55:10,134 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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 73 [2024-10-13 12:55:10,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:55:10,137 INFO L225 Difference]: With dead ends: 1046 [2024-10-13 12:55:10,138 INFO L226 Difference]: Without dead ends: 648 [2024-10-13 12:55:10,138 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:55:10,139 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 49 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 12:55:10,139 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 174 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 12:55:10,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2024-10-13 12:55:10,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 554. [2024-10-13 12:55:10,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 553 states have (on average 1.2766726943942135) internal successors, (706), 553 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:55:10,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 706 transitions. [2024-10-13 12:55:10,156 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 706 transitions. Word has length 73 [2024-10-13 12:55:10,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:55:10,156 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 706 transitions. [2024-10-13 12:55:10,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:55:10,156 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 706 transitions. [2024-10-13 12:55:10,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-13 12:55:10,158 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:55:10,158 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:55:10,175 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-13 12:55:10,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:55:10,359 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-10-13 12:55:10,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:55:10,360 INFO L85 PathProgramCache]: Analyzing trace with hash 623729122, now seen corresponding path program 1 times [2024-10-13 12:55:10,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:55:10,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350760575] [2024-10-13 12:55:10,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:55:10,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:55:10,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:10,519 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-13 12:55:10,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:55:10,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350760575] [2024-10-13 12:55:10,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350760575] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:55:10,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:55:10,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 12:55:10,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10363073] [2024-10-13 12:55:10,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:55:10,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 12:55:10,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:55:10,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 12:55:10,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 12:55:10,521 INFO L87 Difference]: Start difference. First operand 554 states and 706 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:55:10,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:55:10,759 INFO L93 Difference]: Finished difference Result 1344 states and 1703 transitions. [2024-10-13 12:55:10,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 12:55:10,760 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 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 73 [2024-10-13 12:55:10,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:55:10,763 INFO L225 Difference]: With dead ends: 1344 [2024-10-13 12:55:10,763 INFO L226 Difference]: Without dead ends: 793 [2024-10-13 12:55:10,764 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-10-13 12:55:10,764 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 179 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 12:55:10,765 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 272 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 12:55:10,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2024-10-13 12:55:10,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 695. [2024-10-13 12:55:10,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 695 states, 694 states have (on average 1.2622478386167146) internal successors, (876), 694 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:55:10,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 876 transitions. [2024-10-13 12:55:10,785 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 876 transitions. Word has length 73 [2024-10-13 12:55:10,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:55:10,785 INFO L471 AbstractCegarLoop]: Abstraction has 695 states and 876 transitions. [2024-10-13 12:55:10,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:55:10,786 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 876 transitions. [2024-10-13 12:55:10,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-13 12:55:10,787 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:55:10,787 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:55:10,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 12:55:10,787 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-10-13 12:55:10,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:55:10,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1973722739, now seen corresponding path program 1 times [2024-10-13 12:55:10,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:55:10,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230107022] [2024-10-13 12:55:10,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:55:10,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:55:10,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:10,936 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-13 12:55:10,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:55:10,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230107022] [2024-10-13 12:55:10,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230107022] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:55:10,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:55:10,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 12:55:10,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18125690] [2024-10-13 12:55:10,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:55:10,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 12:55:10,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:55:10,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 12:55:10,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-13 12:55:10,938 INFO L87 Difference]: Start difference. First operand 695 states and 876 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:55:11,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:55:11,288 INFO L93 Difference]: Finished difference Result 1730 states and 2170 transitions. [2024-10-13 12:55:11,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 12:55:11,288 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 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 79 [2024-10-13 12:55:11,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:55:11,292 INFO L225 Difference]: With dead ends: 1730 [2024-10-13 12:55:11,292 INFO L226 Difference]: Without dead ends: 960 [2024-10-13 12:55:11,293 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2024-10-13 12:55:11,293 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 176 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 12:55:11,294 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 366 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 12:55:11,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2024-10-13 12:55:11,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 825. [2024-10-13 12:55:11,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 825 states, 824 states have (on average 1.2645631067961165) internal successors, (1042), 824 states have internal predecessors, (1042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:55:11,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 1042 transitions. [2024-10-13 12:55:11,319 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 1042 transitions. Word has length 79 [2024-10-13 12:55:11,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:55:11,320 INFO L471 AbstractCegarLoop]: Abstraction has 825 states and 1042 transitions. [2024-10-13 12:55:11,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:55:11,321 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1042 transitions. [2024-10-13 12:55:11,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-13 12:55:11,322 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:55:11,322 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:55:11,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 12:55:11,323 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-10-13 12:55:11,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:55:11,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1124026941, now seen corresponding path program 1 times [2024-10-13 12:55:11,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:55:11,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158593866] [2024-10-13 12:55:11,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:55:11,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:55:11,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:11,464 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 39 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-13 12:55:11,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:55:11,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158593866] [2024-10-13 12:55:11,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158593866] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 12:55:11,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [133456166] [2024-10-13 12:55:11,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:55:11,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:55:11,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:55:11,466 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 12:55:11,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-13 12:55:11,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:11,526 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-13 12:55:11,528 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:55:11,629 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 26 proven. 43 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-13 12:55:11,629 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:55:11,717 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 39 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-13 12:55:11,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [133456166] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:55:11,719 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 12:55:11,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 4] total 9 [2024-10-13 12:55:11,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021533911] [2024-10-13 12:55:11,719 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 12:55:11,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 12:55:11,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:55:11,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 12:55:11,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-10-13 12:55:11,721 INFO L87 Difference]: Start difference. First operand 825 states and 1042 transitions. Second operand has 10 states, 9 states have (on average 12.333333333333334) internal successors, (111), 10 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:55:13,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:55:13,258 INFO L93 Difference]: Finished difference Result 4971 states and 6139 transitions. [2024-10-13 12:55:13,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2024-10-13 12:55:13,258 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 12.333333333333334) internal successors, (111), 10 states have internal predecessors, (111), 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 79 [2024-10-13 12:55:13,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:55:13,272 INFO L225 Difference]: With dead ends: 4971 [2024-10-13 12:55:13,272 INFO L226 Difference]: Without dead ends: 4015 [2024-10-13 12:55:13,277 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1013 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=592, Invalid=2600, Unknown=0, NotChecked=0, Total=3192 [2024-10-13 12:55:13,277 INFO L432 NwaCegarLoop]: 296 mSDtfsCounter, 793 mSDsluCounter, 1067 mSDsCounter, 0 mSdLazyCounter, 1135 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 793 SdHoareTripleChecker+Valid, 1363 SdHoareTripleChecker+Invalid, 1164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 12:55:13,278 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [793 Valid, 1363 Invalid, 1164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1135 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-13 12:55:13,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4015 states. [2024-10-13 12:55:13,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4015 to 1078. [2024-10-13 12:55:13,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1078 states, 1077 states have (on average 1.4066852367688023) internal successors, (1515), 1077 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:55:13,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1078 states to 1078 states and 1515 transitions. [2024-10-13 12:55:13,340 INFO L78 Accepts]: Start accepts. Automaton has 1078 states and 1515 transitions. Word has length 79 [2024-10-13 12:55:13,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:55:13,341 INFO L471 AbstractCegarLoop]: Abstraction has 1078 states and 1515 transitions. [2024-10-13 12:55:13,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 12.333333333333334) internal successors, (111), 10 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:55:13,341 INFO L276 IsEmpty]: Start isEmpty. Operand 1078 states and 1515 transitions. [2024-10-13 12:55:13,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-13 12:55:13,342 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:55:13,343 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:55:13,359 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-13 12:55:13,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-13 12:55:13,547 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-10-13 12:55:13,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:55:13,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1375690212, now seen corresponding path program 1 times [2024-10-13 12:55:13,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:55:13,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212160929] [2024-10-13 12:55:13,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:55:13,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:55:13,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:13,743 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-13 12:55:13,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:55:13,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212160929] [2024-10-13 12:55:13,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212160929] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:55:13,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:55:13,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 12:55:13,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384167080] [2024-10-13 12:55:13,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:55:13,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 12:55:13,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:55:13,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 12:55:13,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-13 12:55:13,746 INFO L87 Difference]: Start difference. First operand 1078 states and 1515 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:55:14,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:55:14,060 INFO L93 Difference]: Finished difference Result 2424 states and 3399 transitions. [2024-10-13 12:55:14,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 12:55:14,060 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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 79 [2024-10-13 12:55:14,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:55:14,065 INFO L225 Difference]: With dead ends: 2424 [2024-10-13 12:55:14,065 INFO L226 Difference]: Without dead ends: 1330 [2024-10-13 12:55:14,066 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2024-10-13 12:55:14,067 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 198 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 12:55:14,067 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 416 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 12:55:14,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1330 states. [2024-10-13 12:55:14,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1330 to 1238. [2024-10-13 12:55:14,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1238 states, 1237 states have (on average 1.4106709781729991) internal successors, (1745), 1237 states have internal predecessors, (1745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:55:14,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1238 states to 1238 states and 1745 transitions. [2024-10-13 12:55:14,110 INFO L78 Accepts]: Start accepts. Automaton has 1238 states and 1745 transitions. Word has length 79 [2024-10-13 12:55:14,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:55:14,110 INFO L471 AbstractCegarLoop]: Abstraction has 1238 states and 1745 transitions. [2024-10-13 12:55:14,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:55:14,110 INFO L276 IsEmpty]: Start isEmpty. Operand 1238 states and 1745 transitions. [2024-10-13 12:55:14,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-13 12:55:14,112 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:55:14,112 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:55:14,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-13 12:55:14,113 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-10-13 12:55:14,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:55:14,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1520902403, now seen corresponding path program 1 times [2024-10-13 12:55:14,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:55:14,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036919945] [2024-10-13 12:55:14,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:55:14,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:55:14,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:14,289 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-10-13 12:55:14,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:55:14,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036919945] [2024-10-13 12:55:14,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036919945] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:55:14,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:55:14,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:55:14,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15442411] [2024-10-13 12:55:14,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:55:14,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:55:14,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:55:14,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:55:14,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:55:14,291 INFO L87 Difference]: Start difference. First operand 1238 states and 1745 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 2 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:55:14,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:55:14,330 INFO L93 Difference]: Finished difference Result 2432 states and 3435 transitions. [2024-10-13 12:55:14,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:55:14,330 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 2 states have internal predecessors, (52), 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 85 [2024-10-13 12:55:14,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:55:14,335 INFO L225 Difference]: With dead ends: 2432 [2024-10-13 12:55:14,335 INFO L226 Difference]: Without dead ends: 1212 [2024-10-13 12:55:14,337 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:55:14,338 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 92 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 12:55:14,338 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 90 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 12:55:14,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2024-10-13 12:55:14,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 1212. [2024-10-13 12:55:14,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1212 states, 1211 states have (on average 1.412881915772089) internal successors, (1711), 1211 states have internal predecessors, (1711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:55:14,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1212 states to 1212 states and 1711 transitions. [2024-10-13 12:55:14,390 INFO L78 Accepts]: Start accepts. Automaton has 1212 states and 1711 transitions. Word has length 85 [2024-10-13 12:55:14,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:55:14,391 INFO L471 AbstractCegarLoop]: Abstraction has 1212 states and 1711 transitions. [2024-10-13 12:55:14,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 2 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:55:14,391 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 1711 transitions. [2024-10-13 12:55:14,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-13 12:55:14,393 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:55:14,393 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:55:14,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-13 12:55:14,394 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-10-13 12:55:14,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:55:14,394 INFO L85 PathProgramCache]: Analyzing trace with hash -411999080, now seen corresponding path program 1 times [2024-10-13 12:55:14,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:55:14,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470215530] [2024-10-13 12:55:14,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:55:14,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:55:14,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:14,711 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 27 proven. 37 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-13 12:55:14,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:55:14,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470215530] [2024-10-13 12:55:14,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470215530] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 12:55:14,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1697018693] [2024-10-13 12:55:14,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:55:14,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:55:14,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:55:14,714 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 12:55:14,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-13 12:55:14,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:14,778 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 12:55:14,780 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:55:14,850 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-10-13 12:55:14,854 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:55:14,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1697018693] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:55:14,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 12:55:14,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 11 [2024-10-13 12:55:14,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795078757] [2024-10-13 12:55:14,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:55:14,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 12:55:14,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:55:14,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 12:55:14,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-13 12:55:14,856 INFO L87 Difference]: Start difference. First operand 1212 states and 1711 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:55:15,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:55:15,027 INFO L93 Difference]: Finished difference Result 3738 states and 5286 transitions. [2024-10-13 12:55:15,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 12:55:15,028 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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 85 [2024-10-13 12:55:15,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:55:15,041 INFO L225 Difference]: With dead ends: 3738 [2024-10-13 12:55:15,041 INFO L226 Difference]: Without dead ends: 3542 [2024-10-13 12:55:15,043 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-13 12:55:15,044 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 126 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 12:55:15,044 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 353 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 12:55:15,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3542 states. [2024-10-13 12:55:15,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3542 to 1871. [2024-10-13 12:55:15,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1871 states, 1870 states have (on average 1.4272727272727272) internal successors, (2669), 1870 states have internal predecessors, (2669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:55:15,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1871 states to 1871 states and 2669 transitions. [2024-10-13 12:55:15,139 INFO L78 Accepts]: Start accepts. Automaton has 1871 states and 2669 transitions. Word has length 85 [2024-10-13 12:55:15,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:55:15,139 INFO L471 AbstractCegarLoop]: Abstraction has 1871 states and 2669 transitions. [2024-10-13 12:55:15,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:55:15,140 INFO L276 IsEmpty]: Start isEmpty. Operand 1871 states and 2669 transitions. [2024-10-13 12:55:15,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-13 12:55:15,144 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:55:15,144 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:55:15,163 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-13 12:55:15,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-13 12:55:15,349 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-10-13 12:55:15,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:55:15,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1064134612, now seen corresponding path program 1 times [2024-10-13 12:55:15,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:55:15,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695334657] [2024-10-13 12:55:15,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:55:15,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:55:15,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:15,681 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 27 proven. 37 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-13 12:55:15,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:55:15,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695334657] [2024-10-13 12:55:15,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695334657] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 12:55:15,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [270489377] [2024-10-13 12:55:15,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:55:15,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:55:15,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:55:15,684 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 12:55:15,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-13 12:55:15,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:15,774 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 12:55:15,776 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:55:15,835 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-10-13 12:55:15,836 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:55:15,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [270489377] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:55:15,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 12:55:15,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 11 [2024-10-13 12:55:15,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945756692] [2024-10-13 12:55:15,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:55:15,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 12:55:15,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:55:15,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 12:55:15,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-10-13 12:55:15,837 INFO L87 Difference]: Start difference. First operand 1871 states and 2669 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:55:15,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:55:15,994 INFO L93 Difference]: Finished difference Result 4732 states and 6414 transitions. [2024-10-13 12:55:15,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 12:55:15,995 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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 88 [2024-10-13 12:55:15,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:55:16,004 INFO L225 Difference]: With dead ends: 4732 [2024-10-13 12:55:16,004 INFO L226 Difference]: Without dead ends: 2891 [2024-10-13 12:55:16,007 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-10-13 12:55:16,007 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 246 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 12:55:16,008 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 334 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 12:55:16,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2891 states. [2024-10-13 12:55:16,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2891 to 2141. [2024-10-13 12:55:16,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2141 states, 2140 states have (on average 1.2995327102803738) internal successors, (2781), 2140 states have internal predecessors, (2781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:55:16,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2141 states to 2141 states and 2781 transitions. [2024-10-13 12:55:16,085 INFO L78 Accepts]: Start accepts. Automaton has 2141 states and 2781 transitions. Word has length 88 [2024-10-13 12:55:16,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:55:16,087 INFO L471 AbstractCegarLoop]: Abstraction has 2141 states and 2781 transitions. [2024-10-13 12:55:16,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:55:16,088 INFO L276 IsEmpty]: Start isEmpty. Operand 2141 states and 2781 transitions. [2024-10-13 12:55:16,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-13 12:55:16,090 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:55:16,090 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:55:16,107 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-13 12:55:16,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:55:16,291 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-10-13 12:55:16,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:55:16,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1033778790, now seen corresponding path program 1 times [2024-10-13 12:55:16,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:55:16,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654867580] [2024-10-13 12:55:16,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:55:16,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:55:16,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:16,617 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 34 proven. 42 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 12:55:16,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:55:16,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654867580] [2024-10-13 12:55:16,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654867580] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 12:55:16,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2115273016] [2024-10-13 12:55:16,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:55:16,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:55:16,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:55:16,620 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 12:55:16,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-13 12:55:16,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:16,757 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-13 12:55:16,758 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:55:16,832 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-10-13 12:55:16,832 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:55:16,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2115273016] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:55:16,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 12:55:16,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 12 [2024-10-13 12:55:16,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805041554] [2024-10-13 12:55:16,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:55:16,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 12:55:16,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:55:16,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 12:55:16,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-10-13 12:55:16,834 INFO L87 Difference]: Start difference. First operand 2141 states and 2781 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:55:17,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:55:17,025 INFO L93 Difference]: Finished difference Result 5571 states and 7154 transitions. [2024-10-13 12:55:17,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 12:55:17,026 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 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 88 [2024-10-13 12:55:17,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:55:17,043 INFO L225 Difference]: With dead ends: 5571 [2024-10-13 12:55:17,043 INFO L226 Difference]: Without dead ends: 5353 [2024-10-13 12:55:17,046 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-10-13 12:55:17,046 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 177 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 12:55:17,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 560 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 12:55:17,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5353 states. [2024-10-13 12:55:17,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5353 to 2141. [2024-10-13 12:55:17,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2141 states, 2140 states have (on average 1.2995327102803738) internal successors, (2781), 2140 states have internal predecessors, (2781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:55:17,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2141 states to 2141 states and 2781 transitions. [2024-10-13 12:55:17,214 INFO L78 Accepts]: Start accepts. Automaton has 2141 states and 2781 transitions. Word has length 88 [2024-10-13 12:55:17,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:55:17,214 INFO L471 AbstractCegarLoop]: Abstraction has 2141 states and 2781 transitions. [2024-10-13 12:55:17,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:55:17,215 INFO L276 IsEmpty]: Start isEmpty. Operand 2141 states and 2781 transitions. [2024-10-13 12:55:17,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-13 12:55:17,218 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:55:17,218 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:55:17,236 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-13 12:55:17,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:55:17,420 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-10-13 12:55:17,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:55:17,420 INFO L85 PathProgramCache]: Analyzing trace with hash 875112187, now seen corresponding path program 1 times [2024-10-13 12:55:17,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:55:17,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856324763] [2024-10-13 12:55:17,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:55:17,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:55:17,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:17,642 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 50 proven. 3 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-10-13 12:55:17,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:55:17,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856324763] [2024-10-13 12:55:17,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856324763] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 12:55:17,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868020739] [2024-10-13 12:55:17,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:55:17,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:55:17,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:55:17,645 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 12:55:17,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-13 12:55:17,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:17,708 INFO L255 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 12:55:17,710 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:55:17,762 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 49 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-13 12:55:17,762 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:55:17,889 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 40 proven. 28 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-13 12:55:17,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [868020739] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:55:17,890 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 12:55:17,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 5] total 10 [2024-10-13 12:55:17,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353742126] [2024-10-13 12:55:17,890 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 12:55:17,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 12:55:17,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:55:17,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 12:55:17,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-13 12:55:17,892 INFO L87 Difference]: Start difference. First operand 2141 states and 2781 transitions. Second operand has 11 states, 11 states have (on average 13.181818181818182) internal successors, (145), 10 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:55:18,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:55:18,186 INFO L93 Difference]: Finished difference Result 3489 states and 4526 transitions. [2024-10-13 12:55:18,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 12:55:18,187 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 13.181818181818182) internal successors, (145), 10 states have internal predecessors, (145), 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 88 [2024-10-13 12:55:18,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:55:18,191 INFO L225 Difference]: With dead ends: 3489 [2024-10-13 12:55:18,191 INFO L226 Difference]: Without dead ends: 1370 [2024-10-13 12:55:18,194 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2024-10-13 12:55:18,195 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 275 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 12:55:18,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 291 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 12:55:18,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states. [2024-10-13 12:55:18,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 1104. [2024-10-13 12:55:18,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1104 states, 1103 states have (on average 1.1749773345421577) internal successors, (1296), 1103 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:55:18,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1104 states to 1104 states and 1296 transitions. [2024-10-13 12:55:18,235 INFO L78 Accepts]: Start accepts. Automaton has 1104 states and 1296 transitions. Word has length 88 [2024-10-13 12:55:18,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:55:18,236 INFO L471 AbstractCegarLoop]: Abstraction has 1104 states and 1296 transitions. [2024-10-13 12:55:18,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 13.181818181818182) internal successors, (145), 10 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:55:18,236 INFO L276 IsEmpty]: Start isEmpty. Operand 1104 states and 1296 transitions. [2024-10-13 12:55:18,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-13 12:55:18,237 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:55:18,237 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:55:18,254 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-13 12:55:18,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-10-13 12:55:18,442 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-10-13 12:55:18,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:55:18,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1946046407, now seen corresponding path program 1 times [2024-10-13 12:55:18,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:55:18,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554160239] [2024-10-13 12:55:18,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:55:18,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:55:18,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:18,620 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 54 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-10-13 12:55:18,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:55:18,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554160239] [2024-10-13 12:55:18,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554160239] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 12:55:18,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804572433] [2024-10-13 12:55:18,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:55:18,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:55:18,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:55:18,625 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 12:55:18,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-13 12:55:18,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:18,685 INFO L255 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 12:55:18,687 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:55:18,748 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-13 12:55:18,748 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:55:18,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1804572433] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:55:18,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 12:55:18,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2024-10-13 12:55:18,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561005498] [2024-10-13 12:55:18,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:55:18,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:55:18,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:55:18,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:55:18,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-13 12:55:18,751 INFO L87 Difference]: Start difference. First operand 1104 states and 1296 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:55:18,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:55:18,894 INFO L93 Difference]: Finished difference Result 1758 states and 2055 transitions. [2024-10-13 12:55:18,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:55:18,895 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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 88 [2024-10-13 12:55:18,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:55:18,903 INFO L225 Difference]: With dead ends: 1758 [2024-10-13 12:55:18,903 INFO L226 Difference]: Without dead ends: 1547 [2024-10-13 12:55:18,904 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-13 12:55:18,905 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 47 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 12:55:18,905 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 204 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 12:55:18,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1547 states. [2024-10-13 12:55:18,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1547 to 1450. [2024-10-13 12:55:18,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1450 states, 1449 states have (on average 1.1780538302277432) internal successors, (1707), 1449 states have internal predecessors, (1707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:55:18,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1450 states to 1450 states and 1707 transitions. [2024-10-13 12:55:18,959 INFO L78 Accepts]: Start accepts. Automaton has 1450 states and 1707 transitions. Word has length 88 [2024-10-13 12:55:18,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:55:18,959 INFO L471 AbstractCegarLoop]: Abstraction has 1450 states and 1707 transitions. [2024-10-13 12:55:18,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:55:18,960 INFO L276 IsEmpty]: Start isEmpty. Operand 1450 states and 1707 transitions. [2024-10-13 12:55:18,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-13 12:55:18,961 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:55:18,961 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:55:18,978 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-13 12:55:19,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:55:19,167 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-10-13 12:55:19,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:55:19,168 INFO L85 PathProgramCache]: Analyzing trace with hash -220371422, now seen corresponding path program 1 times [2024-10-13 12:55:19,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:55:19,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9551793] [2024-10-13 12:55:19,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:55:19,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:55:19,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:19,455 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 34 proven. 42 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 12:55:19,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:55:19,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9551793] [2024-10-13 12:55:19,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9551793] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 12:55:19,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1902771801] [2024-10-13 12:55:19,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:55:19,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:55:19,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:55:19,458 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 12:55:19,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-13 12:55:19,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:19,555 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-13 12:55:19,556 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:55:19,709 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-13 12:55:19,709 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:55:19,948 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-13 12:55:19,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1902771801] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:55:19,949 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 12:55:19,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2024-10-13 12:55:19,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550147912] [2024-10-13 12:55:19,949 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 12:55:19,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-13 12:55:19,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:55:19,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-13 12:55:19,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2024-10-13 12:55:19,951 INFO L87 Difference]: Start difference. First operand 1450 states and 1707 transitions. Second operand has 18 states, 18 states have (on average 11.166666666666666) internal successors, (201), 17 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:55:20,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:55:20,999 INFO L93 Difference]: Finished difference Result 3031 states and 3489 transitions. [2024-10-13 12:55:20,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-10-13 12:55:21,000 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 11.166666666666666) internal successors, (201), 17 states have internal predecessors, (201), 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 90 [2024-10-13 12:55:21,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:55:21,010 INFO L225 Difference]: With dead ends: 3031 [2024-10-13 12:55:21,014 INFO L226 Difference]: Without dead ends: 2639 [2024-10-13 12:55:21,016 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 458 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=583, Invalid=1769, Unknown=0, NotChecked=0, Total=2352 [2024-10-13 12:55:21,017 INFO L432 NwaCegarLoop]: 246 mSDtfsCounter, 805 mSDsluCounter, 1612 mSDsCounter, 0 mSdLazyCounter, 541 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 805 SdHoareTripleChecker+Valid, 1858 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 12:55:21,017 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [805 Valid, 1858 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 541 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 12:55:21,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2639 states. [2024-10-13 12:55:21,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2639 to 938. [2024-10-13 12:55:21,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 938 states, 937 states have (on average 1.135538954108858) internal successors, (1064), 937 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:55:21,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 1064 transitions. [2024-10-13 12:55:21,065 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 1064 transitions. Word has length 90 [2024-10-13 12:55:21,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:55:21,065 INFO L471 AbstractCegarLoop]: Abstraction has 938 states and 1064 transitions. [2024-10-13 12:55:21,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 11.166666666666666) internal successors, (201), 17 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:55:21,066 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 1064 transitions. [2024-10-13 12:55:21,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-13 12:55:21,067 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:55:21,067 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:55:21,086 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-13 12:55:21,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-10-13 12:55:21,268 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-10-13 12:55:21,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:55:21,269 INFO L85 PathProgramCache]: Analyzing trace with hash -483855834, now seen corresponding path program 1 times [2024-10-13 12:55:21,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:55:21,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235950281] [2024-10-13 12:55:21,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:55:21,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:55:21,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:21,434 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 51 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-13 12:55:21,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:55:21,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235950281] [2024-10-13 12:55:21,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235950281] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 12:55:21,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [727994980] [2024-10-13 12:55:21,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:55:21,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:55:21,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:55:21,437 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 12:55:21,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-13 12:55:21,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:21,557 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-13 12:55:21,558 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:55:21,653 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 51 proven. 4 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-10-13 12:55:21,653 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:55:21,872 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 44 proven. 31 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-13 12:55:21,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [727994980] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:55:21,873 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 12:55:21,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 9] total 17 [2024-10-13 12:55:21,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697215794] [2024-10-13 12:55:21,873 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 12:55:21,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-13 12:55:21,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:55:21,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-13 12:55:21,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2024-10-13 12:55:21,874 INFO L87 Difference]: Start difference. First operand 938 states and 1064 transitions. Second operand has 17 states, 17 states have (on average 9.294117647058824) internal successors, (158), 17 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:55:23,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:55:23,103 INFO L93 Difference]: Finished difference Result 2831 states and 3225 transitions. [2024-10-13 12:55:23,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-10-13 12:55:23,104 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 9.294117647058824) internal successors, (158), 17 states have internal predecessors, (158), 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 91 [2024-10-13 12:55:23,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:55:23,112 INFO L225 Difference]: With dead ends: 2831 [2024-10-13 12:55:23,112 INFO L226 Difference]: Without dead ends: 1699 [2024-10-13 12:55:23,114 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=535, Invalid=1105, Unknown=0, NotChecked=0, Total=1640 [2024-10-13 12:55:23,115 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 906 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 906 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 12:55:23,116 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [906 Valid, 579 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 769 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 12:55:23,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1699 states. [2024-10-13 12:55:23,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1699 to 1264. [2024-10-13 12:55:23,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1264 states, 1263 states have (on average 1.144893111638955) internal successors, (1446), 1263 states have internal predecessors, (1446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:55:23,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1264 states to 1264 states and 1446 transitions. [2024-10-13 12:55:23,178 INFO L78 Accepts]: Start accepts. Automaton has 1264 states and 1446 transitions. Word has length 91 [2024-10-13 12:55:23,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:55:23,179 INFO L471 AbstractCegarLoop]: Abstraction has 1264 states and 1446 transitions. [2024-10-13 12:55:23,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 9.294117647058824) internal successors, (158), 17 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:55:23,179 INFO L276 IsEmpty]: Start isEmpty. Operand 1264 states and 1446 transitions. [2024-10-13 12:55:23,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-13 12:55:23,180 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:55:23,180 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:55:23,197 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-10-13 12:55:23,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-10-13 12:55:23,381 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-10-13 12:55:23,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:55:23,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1167746698, now seen corresponding path program 1 times [2024-10-13 12:55:23,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:55:23,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790323899] [2024-10-13 12:55:23,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:55:23,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:55:23,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:23,668 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 27 proven. 37 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-13 12:55:23,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:55:23,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790323899] [2024-10-13 12:55:23,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790323899] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 12:55:23,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [605901442] [2024-10-13 12:55:23,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:55:23,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:55:23,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:55:23,671 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 12:55:23,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-13 12:55:24,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:24,590 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-13 12:55:24,591 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:55:24,731 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 67 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-13 12:55:24,732 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:55:24,894 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 51 proven. 22 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-13 12:55:24,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [605901442] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:55:24,894 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 12:55:24,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2024-10-13 12:55:24,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251433196] [2024-10-13 12:55:24,895 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 12:55:24,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-13 12:55:24,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:55:24,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-13 12:55:24,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2024-10-13 12:55:24,896 INFO L87 Difference]: Start difference. First operand 1264 states and 1446 transitions. Second operand has 16 states, 16 states have (on average 14.25) internal successors, (228), 15 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:55:25,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:55:25,835 INFO L93 Difference]: Finished difference Result 2780 states and 3115 transitions. [2024-10-13 12:55:25,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-13 12:55:25,836 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 14.25) internal successors, (228), 15 states have internal predecessors, (228), 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 96 [2024-10-13 12:55:25,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:55:25,837 INFO L225 Difference]: With dead ends: 2780 [2024-10-13 12:55:25,837 INFO L226 Difference]: Without dead ends: 768 [2024-10-13 12:55:25,840 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=323, Invalid=1009, Unknown=0, NotChecked=0, Total=1332 [2024-10-13 12:55:25,840 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 815 mSDsluCounter, 1223 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 815 SdHoareTripleChecker+Valid, 1426 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 12:55:25,840 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [815 Valid, 1426 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 12:55:25,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2024-10-13 12:55:25,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 426. [2024-10-13 12:55:25,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 425 states have (on average 1.1764705882352942) internal successors, (500), 425 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:55:25,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 500 transitions. [2024-10-13 12:55:25,862 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 500 transitions. Word has length 96 [2024-10-13 12:55:25,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:55:25,862 INFO L471 AbstractCegarLoop]: Abstraction has 426 states and 500 transitions. [2024-10-13 12:55:25,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 14.25) internal successors, (228), 15 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:55:25,862 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 500 transitions. [2024-10-13 12:55:25,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-13 12:55:25,863 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:55:25,863 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:55:25,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-10-13 12:55:26,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-10-13 12:55:26,068 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-10-13 12:55:26,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:55:26,068 INFO L85 PathProgramCache]: Analyzing trace with hash 945640225, now seen corresponding path program 1 times [2024-10-13 12:55:26,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:55:26,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823762061] [2024-10-13 12:55:26,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:55:26,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:55:26,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 12:55:26,122 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 12:55:26,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 12:55:26,210 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 12:55:26,211 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 12:55:26,211 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 41 remaining) [2024-10-13 12:55:26,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 41 remaining) [2024-10-13 12:55:26,214 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 41 remaining) [2024-10-13 12:55:26,214 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 41 remaining) [2024-10-13 12:55:26,214 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 41 remaining) [2024-10-13 12:55:26,214 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 41 remaining) [2024-10-13 12:55:26,214 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 41 remaining) [2024-10-13 12:55:26,214 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 41 remaining) [2024-10-13 12:55:26,215 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 41 remaining) [2024-10-13 12:55:26,215 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 41 remaining) [2024-10-13 12:55:26,215 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 41 remaining) [2024-10-13 12:55:26,215 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 41 remaining) [2024-10-13 12:55:26,215 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 41 remaining) [2024-10-13 12:55:26,215 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 41 remaining) [2024-10-13 12:55:26,216 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 41 remaining) [2024-10-13 12:55:26,216 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 41 remaining) [2024-10-13 12:55:26,216 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 41 remaining) [2024-10-13 12:55:26,216 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 41 remaining) [2024-10-13 12:55:26,216 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 41 remaining) [2024-10-13 12:55:26,216 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 41 remaining) [2024-10-13 12:55:26,216 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 41 remaining) [2024-10-13 12:55:26,216 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 41 remaining) [2024-10-13 12:55:26,217 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 41 remaining) [2024-10-13 12:55:26,217 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 41 remaining) [2024-10-13 12:55:26,217 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 41 remaining) [2024-10-13 12:55:26,217 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 41 remaining) [2024-10-13 12:55:26,217 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 41 remaining) [2024-10-13 12:55:26,217 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 41 remaining) [2024-10-13 12:55:26,217 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 41 remaining) [2024-10-13 12:55:26,218 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 41 remaining) [2024-10-13 12:55:26,218 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 41 remaining) [2024-10-13 12:55:26,218 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 41 remaining) [2024-10-13 12:55:26,218 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 41 remaining) [2024-10-13 12:55:26,218 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 41 remaining) [2024-10-13 12:55:26,218 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 41 remaining) [2024-10-13 12:55:26,218 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 41 remaining) [2024-10-13 12:55:26,219 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 41 remaining) [2024-10-13 12:55:26,219 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 41 remaining) [2024-10-13 12:55:26,219 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 41 remaining) [2024-10-13 12:55:26,219 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 41 remaining) [2024-10-13 12:55:26,219 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 41 remaining) [2024-10-13 12:55:26,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-13 12:55:26,223 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:55:26,310 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 12:55:26,315 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 12:55:26 BoogieIcfgContainer [2024-10-13 12:55:26,315 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 12:55:26,316 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 12:55:26,316 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 12:55:26,316 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 12:55:26,316 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:55:05" (3/4) ... [2024-10-13 12:55:26,317 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-13 12:55:26,401 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 12:55:26,402 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 12:55:26,402 INFO L158 Benchmark]: Toolchain (without parser) took 22107.04ms. Allocated memory was 163.6MB in the beginning and 440.4MB in the end (delta: 276.8MB). Free memory was 97.0MB in the beginning and 163.4MB in the end (delta: -66.4MB). Peak memory consumption was 209.1MB. Max. memory is 16.1GB. [2024-10-13 12:55:26,402 INFO L158 Benchmark]: CDTParser took 0.86ms. Allocated memory is still 96.5MB. Free memory is still 50.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 12:55:26,403 INFO L158 Benchmark]: CACSL2BoogieTranslator took 365.99ms. Allocated memory is still 163.6MB. Free memory was 96.6MB in the beginning and 124.7MB in the end (delta: -28.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 12:55:26,403 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.78ms. Allocated memory is still 163.6MB. Free memory was 124.7MB in the beginning and 120.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 12:55:26,403 INFO L158 Benchmark]: Boogie Preprocessor took 61.46ms. Allocated memory is still 163.6MB. Free memory was 120.5MB in the beginning and 117.1MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 12:55:26,403 INFO L158 Benchmark]: RCFGBuilder took 597.09ms. Allocated memory is still 163.6MB. Free memory was 117.1MB in the beginning and 86.5MB in the end (delta: 30.6MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-10-13 12:55:26,403 INFO L158 Benchmark]: TraceAbstraction took 20928.24ms. Allocated memory was 163.6MB in the beginning and 440.4MB in the end (delta: 276.8MB). Free memory was 85.6MB in the beginning and 172.8MB in the end (delta: -87.2MB). Peak memory consumption was 191.5MB. Max. memory is 16.1GB. [2024-10-13 12:55:26,403 INFO L158 Benchmark]: Witness Printer took 85.93ms. Allocated memory is still 440.4MB. Free memory was 172.8MB in the beginning and 163.4MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-13 12:55:26,405 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.86ms. Allocated memory is still 96.5MB. Free memory is still 50.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 365.99ms. Allocated memory is still 163.6MB. Free memory was 96.6MB in the beginning and 124.7MB in the end (delta: -28.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.78ms. Allocated memory is still 163.6MB. Free memory was 124.7MB in the beginning and 120.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.46ms. Allocated memory is still 163.6MB. Free memory was 120.5MB in the beginning and 117.1MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 597.09ms. Allocated memory is still 163.6MB. Free memory was 117.1MB in the beginning and 86.5MB in the end (delta: 30.6MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 20928.24ms. Allocated memory was 163.6MB in the beginning and 440.4MB in the end (delta: 276.8MB). Free memory was 85.6MB in the beginning and 172.8MB in the end (delta: -87.2MB). Peak memory consumption was 191.5MB. Max. memory is 16.1GB. * Witness Printer took 85.93ms. Allocated memory is still 440.4MB. Free memory was 172.8MB in the beginning and 163.4MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 116]: integer overflow possible integer overflow possible We found a FailurePath: [L124] unsigned int a, b, r; [L126] b = __VERIFIER_nondet_uint() [L128] a = 234770789 [L130] CALL mp_add(a, b) [L42] unsigned char a0, a1, a2, a3; [L43] unsigned char b0, b1, b2, b3; [L44] unsigned char r0, r1, r2, r3; [L45] unsigned short carry; [L46] unsigned short partial_sum; [L47] unsigned int r; [L48] unsigned char i; [L49] unsigned char na, nb; [L50] a0 = a [L51] a1 = a >> 8 [L52] a2 = a >> 16U [L53] a3 = a >> 24U [L54] b0 = b [L55] b1 = b >> 8U [L56] b2 = b >> 16U [L57] b3 = b >> 24U [L58] na = (unsigned char)4 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, na=4] [L59] COND FALSE !(a3 == (unsigned char)0) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, na=4] [L68] nb = (unsigned char)4 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, na=4, nb=4] [L69] COND FALSE !(b3 == (unsigned char)0) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, na=4, nb=4] [L78] carry = (unsigned short)0 [L79] i = (unsigned char)0 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=0, na=4, nb=4] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=0, na=4, nb=4, partial_sum=0] [L83] COND TRUE i < na VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=0, na=4, nb=4, partial_sum=0] [L84] COND TRUE i == (unsigned char)0 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=0, na=4, nb=4, partial_sum=0] [L84] EXPR partial_sum + a0 [L84] partial_sum = partial_sum + a0 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=0, na=4, nb=4, partial_sum=101] [L85] COND FALSE !(i == (unsigned char)1) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=0, na=4, nb=4, partial_sum=101] [L86] COND FALSE !(i == (unsigned char)2) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=0, na=4, nb=4, partial_sum=101] [L87] COND FALSE !(i == (unsigned char)3) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=0, na=4, nb=4, partial_sum=101] [L89] COND TRUE i < nb VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=0, na=4, nb=4, partial_sum=101] [L90] COND TRUE i == (unsigned char)0 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=0, na=4, nb=4, partial_sum=101] [L90] EXPR partial_sum + b0 [L90] partial_sum = partial_sum + b0 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=0, na=4, nb=4, partial_sum=256] [L91] COND FALSE !(i == (unsigned char)1) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=0, na=4, nb=4, partial_sum=256] [L92] COND FALSE !(i == (unsigned char)2) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=0, na=4, nb=4, partial_sum=256] [L93] COND FALSE !(i == (unsigned char)3) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=0, na=4, nb=4, partial_sum=256] [L95] COND TRUE partial_sum > ((unsigned char)255) [L96] partial_sum = partial_sum & ((unsigned char)255) [L97] carry = (unsigned short)1 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=1, i=0, na=4, nb=4, partial_sum=0] [L99] COND TRUE i == (unsigned char)0 [L99] r0 = (unsigned char)partial_sum VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=1, i=0, na=4, nb=4, partial_sum=0, r0=0] [L100] COND FALSE !(i == (unsigned char)1) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=1, i=0, na=4, nb=4, partial_sum=0, r0=0] [L101] COND FALSE !(i == (unsigned char)2) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=1, i=0, na=4, nb=4, partial_sum=0, r0=0] [L102] COND FALSE !(i == (unsigned char)3) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=1, i=0, na=4, nb=4, partial_sum=0, r0=0] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=1, i=1, na=4, nb=4, partial_sum=0, r0=0] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=1, na=4, nb=4, partial_sum=1, r0=0] [L83] COND TRUE i < na VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=1, na=4, nb=4, partial_sum=1, r0=0] [L84] COND FALSE !(i == (unsigned char)0) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=1, na=4, nb=4, partial_sum=1, r0=0] [L85] COND TRUE i == (unsigned char)1 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=1, na=4, nb=4, partial_sum=1, r0=0] [L85] EXPR partial_sum + a1 [L85] partial_sum = partial_sum + a1 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=1, na=4, nb=4, partial_sum=82, r0=0] [L86] COND FALSE !(i == (unsigned char)2) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=1, na=4, nb=4, partial_sum=82, r0=0] [L87] COND FALSE !(i == (unsigned char)3) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=1, na=4, nb=4, partial_sum=82, r0=0] [L89] COND TRUE i < nb VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=1, na=4, nb=4, partial_sum=82, r0=0] [L90] COND FALSE !(i == (unsigned char)0) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=1, na=4, nb=4, partial_sum=82, r0=0] [L91] COND TRUE i == (unsigned char)1 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=1, na=4, nb=4, partial_sum=82, r0=0] [L91] EXPR partial_sum + b1 [L91] partial_sum = partial_sum + b1 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=1, na=4, nb=4, partial_sum=256, r0=0] [L92] COND FALSE !(i == (unsigned char)2) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=1, na=4, nb=4, partial_sum=256, r0=0] [L93] COND FALSE !(i == (unsigned char)3) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=1, na=4, nb=4, partial_sum=256, r0=0] [L95] COND TRUE partial_sum > ((unsigned char)255) [L96] partial_sum = partial_sum & ((unsigned char)255) [L97] carry = (unsigned short)1 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=1, i=1, na=4, nb=4, partial_sum=0, r0=0] [L99] COND FALSE !(i == (unsigned char)0) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=1, i=1, na=4, nb=4, partial_sum=0, r0=0] [L100] COND TRUE i == (unsigned char)1 [L100] r1 = (unsigned char)partial_sum VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=1, i=1, na=4, nb=4, partial_sum=0, r0=0, r1=0] [L101] COND FALSE !(i == (unsigned char)2) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=1, i=1, na=4, nb=4, partial_sum=0, r0=0, r1=0] [L102] COND FALSE !(i == (unsigned char)3) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=1, i=1, na=4, nb=4, partial_sum=0, r0=0, r1=0] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=1, i=2, na=4, nb=4, partial_sum=0, r0=0, r1=0] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=0, r1=0] [L83] COND TRUE i < na VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=0, r1=0] [L84] COND FALSE !(i == (unsigned char)0) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=0, r1=0] [L85] COND FALSE !(i == (unsigned char)1) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=0, r1=0] [L86] COND TRUE i == (unsigned char)2 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=0, r1=0] [L86] EXPR partial_sum + a2 [L86] partial_sum = partial_sum + a2 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=2, na=4, nb=4, partial_sum=255, r0=0, r1=0] [L87] COND FALSE !(i == (unsigned char)3) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=2, na=4, nb=4, partial_sum=255, r0=0, r1=0] [L89] COND TRUE i < nb VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=2, na=4, nb=4, partial_sum=255, r0=0, r1=0] [L90] COND FALSE !(i == (unsigned char)0) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=2, na=4, nb=4, partial_sum=255, r0=0, r1=0] [L91] COND FALSE !(i == (unsigned char)1) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=2, na=4, nb=4, partial_sum=255, r0=0, r1=0] [L92] COND TRUE i == (unsigned char)2 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=2, na=4, nb=4, partial_sum=255, r0=0, r1=0] [L92] EXPR partial_sum + b2 [L92] partial_sum = partial_sum + b2 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=2, na=4, nb=4, partial_sum=256, r0=0, r1=0] [L93] COND FALSE !(i == (unsigned char)3) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=2, na=4, nb=4, partial_sum=256, r0=0, r1=0] [L95] COND TRUE partial_sum > ((unsigned char)255) [L96] partial_sum = partial_sum & ((unsigned char)255) [L97] carry = (unsigned short)1 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=1, i=2, na=4, nb=4, partial_sum=0, r0=0, r1=0] [L99] COND FALSE !(i == (unsigned char)0) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=1, i=2, na=4, nb=4, partial_sum=0, r0=0, r1=0] [L100] COND FALSE !(i == (unsigned char)1) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=1, i=2, na=4, nb=4, partial_sum=0, r0=0, r1=0] [L101] COND TRUE i == (unsigned char)2 [L101] r2 = (unsigned char)partial_sum VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=1, i=2, na=4, nb=4, partial_sum=0, r0=0, r1=0, r2=0] [L102] COND FALSE !(i == (unsigned char)3) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=1, i=2, na=4, nb=4, partial_sum=0, r0=0, r1=0, r2=0] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=1, i=3, na=4, nb=4, partial_sum=0, r0=0, r1=0, r2=0] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=0, r1=0, r2=0] [L83] COND TRUE i < na VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=0, r1=0, r2=0] [L84] COND FALSE !(i == (unsigned char)0) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=0, r1=0, r2=0] [L85] COND FALSE !(i == (unsigned char)1) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=0, r1=0, r2=0] [L86] COND FALSE !(i == (unsigned char)2) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=0, r1=0, r2=0] [L87] COND TRUE i == (unsigned char)3 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=0, r1=0, r2=0] [L87] EXPR partial_sum + a3 [L87] partial_sum = partial_sum + a3 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=3, na=4, nb=4, partial_sum=14, r0=0, r1=0, r2=0] [L89] COND TRUE i < nb VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=3, na=4, nb=4, partial_sum=14, r0=0, r1=0, r2=0] [L90] COND FALSE !(i == (unsigned char)0) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=3, na=4, nb=4, partial_sum=14, r0=0, r1=0, r2=0] [L91] COND FALSE !(i == (unsigned char)1) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=3, na=4, nb=4, partial_sum=14, r0=0, r1=0, r2=0] [L92] COND FALSE !(i == (unsigned char)2) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=3, na=4, nb=4, partial_sum=14, r0=0, r1=0, r2=0] [L93] COND TRUE i == (unsigned char)3 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=3, na=4, nb=4, partial_sum=14, r0=0, r1=0, r2=0] [L93] EXPR partial_sum + b3 [L93] partial_sum = partial_sum + b3 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=3, na=4, nb=4, partial_sum=255, r0=0, r1=0, r2=0] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=3, na=4, nb=4, partial_sum=255, r0=0, r1=0, r2=0] [L99] COND FALSE !(i == (unsigned char)0) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=3, na=4, nb=4, partial_sum=255, r0=0, r1=0, r2=0] [L100] COND FALSE !(i == (unsigned char)1) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=3, na=4, nb=4, partial_sum=255, r0=0, r1=0, r2=0] [L101] COND FALSE !(i == (unsigned char)2) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=3, na=4, nb=4, partial_sum=255, r0=0, r1=0, r2=0] [L102] COND TRUE i == (unsigned char)3 [L102] r3 = (unsigned char)partial_sum VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=3, na=4, nb=4, r0=0, r1=0, r2=0, r3=255] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=4, na=4, nb=4, r0=0, r1=0, r2=0, r3=255] [L80] COND FALSE !((i < na) || (i < nb) || (carry != (unsigned short)0)) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, i=4, r0=0, r1=0, r2=0, r3=255] [L107] COND FALSE !(i < (unsigned char)4) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, r0=0, r1=0, r2=0, r3=255] [L116] EXPR r1 << 8U VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, r0=0, r1=0, r2=0, r3=255] [L116] EXPR r0 | (r1 << 8U) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, r2=0, r3=255] [L116] EXPR r2 << 16U VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, r2=0, r3=255] [L116] r0 | (r1 << 8U) | (r2 << 16U) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, r3=255] [L116] r3 << 24U VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241] - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 62]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 62]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 84]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 84]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 90]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 90]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 91]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 91]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 92]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 92]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 104]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 104]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 127 locations, 41 error locations. Started 1 CEGAR loops. OverallTime: 20.8s, OverallIterations: 26, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 8.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5656 SdHoareTripleChecker+Valid, 4.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5656 mSDsluCounter, 11031 SdHoareTripleChecker+Invalid, 4.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8005 mSDsCounter, 432 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5550 IncrementalHoareTripleChecker+Invalid, 5982 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 432 mSolverCounterUnsat, 3026 mSDtfsCounter, 5550 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1716 GetRequests, 1424 SyntacticMatches, 2 SemanticMatches, 290 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2202 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2141occurred in iteration=19, InterpolantAutomatonStates: 262, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 25 MinimizatonAttempts, 12385 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 2689 NumberOfCodeBlocks, 2689 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 2985 ConstructedInterpolants, 0 QuantifiedInterpolants, 11129 SizeOfPredicates, 19 NumberOfNonLiveVariables, 2063 ConjunctsInSsa, 120 ConjunctsInUnsatCore, 42 InterpolantComputations, 20 PerfectInterpolantSequences, 2302/2751 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 RESULT: Ultimate proved your program to be incorrect! [2024-10-13 12:55:26,445 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)