./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/divbin_unwindbound20.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/divbin_unwindbound20.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 7e073a4c36b82f2b6062e496bb836cd3d16667ec7228f4ab2b6689e74fa81265 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 10:35:33,147 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 10:35:33,206 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-19 10:35:33,214 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 10:35:33,215 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 10:35:33,264 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 10:35:33,264 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 10:35:33,265 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 10:35:33,265 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 10:35:33,266 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 10:35:33,266 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 10:35:33,266 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 10:35:33,269 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 10:35:33,270 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 10:35:33,270 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 10:35:33,270 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 10:35:33,271 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 10:35:33,271 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 10:35:33,271 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 10:35:33,271 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 10:35:33,272 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 10:35:33,275 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 10:35:33,276 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 10:35:33,276 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 10:35:33,276 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 10:35:33,277 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-19 10:35:33,277 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 10:35:33,278 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 10:35:33,278 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 10:35:33,279 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 10:35:33,279 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 10:35:33,279 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 10:35:33,279 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 10:35:33,280 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 10:35:33,280 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 10:35:33,280 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 10:35:33,281 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 10:35:33,281 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 10:35:33,281 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 10:35:33,281 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 10:35:33,281 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 10:35:33,282 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 10:35:33,282 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 10:35:33,282 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 10:35:33,283 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 -> 7e073a4c36b82f2b6062e496bb836cd3d16667ec7228f4ab2b6689e74fa81265 [2024-11-19 10:35:33,522 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 10:35:33,546 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 10:35:33,549 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 10:35:33,550 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 10:35:33,551 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 10:35:33,552 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/divbin_unwindbound20.i [2024-11-19 10:35:35,090 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 10:35:35,280 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 10:35:35,280 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/divbin_unwindbound20.i [2024-11-19 10:35:35,287 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8d42d645/0e8313b54bcb4f59a5f7169bbf8d39ed/FLAG6a381be12 [2024-11-19 10:35:35,301 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8d42d645/0e8313b54bcb4f59a5f7169bbf8d39ed [2024-11-19 10:35:35,305 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 10:35:35,306 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 10:35:35,310 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 10:35:35,311 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 10:35:35,316 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 10:35:35,316 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:35:35" (1/1) ... [2024-11-19 10:35:35,317 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c201236 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:35:35, skipping insertion in model container [2024-11-19 10:35:35,317 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:35:35" (1/1) ... [2024-11-19 10:35:35,336 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 10:35:35,514 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 10:35:35,522 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 10:35:35,540 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 10:35:35,557 INFO L204 MainTranslator]: Completed translation [2024-11-19 10:35:35,558 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:35:35 WrapperNode [2024-11-19 10:35:35,558 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 10:35:35,559 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 10:35:35,559 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 10:35:35,559 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 10:35:35,567 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:35:35" (1/1) ... [2024-11-19 10:35:35,573 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:35:35" (1/1) ... [2024-11-19 10:35:35,590 INFO L138 Inliner]: procedures = 16, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 66 [2024-11-19 10:35:35,591 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 10:35:35,592 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 10:35:35,592 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 10:35:35,592 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 10:35:35,601 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:35:35" (1/1) ... [2024-11-19 10:35:35,601 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:35:35" (1/1) ... [2024-11-19 10:35:35,602 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:35:35" (1/1) ... [2024-11-19 10:35:35,615 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-19 10:35:35,616 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:35:35" (1/1) ... [2024-11-19 10:35:35,616 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:35:35" (1/1) ... [2024-11-19 10:35:35,619 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:35:35" (1/1) ... [2024-11-19 10:35:35,624 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:35:35" (1/1) ... [2024-11-19 10:35:35,625 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:35:35" (1/1) ... [2024-11-19 10:35:35,626 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:35:35" (1/1) ... [2024-11-19 10:35:35,631 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 10:35:35,633 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 10:35:35,633 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 10:35:35,633 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 10:35:35,634 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:35:35" (1/1) ... [2024-11-19 10:35:35,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 10:35:35,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:35:35,669 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 10:35:35,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 10:35:35,723 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 10:35:35,724 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 10:35:35,724 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 10:35:35,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 10:35:35,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 10:35:35,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 10:35:35,724 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-19 10:35:35,724 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-19 10:35:35,797 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 10:35:35,801 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 10:35:36,008 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-19 10:35:36,010 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 10:35:36,022 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 10:35:36,022 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-19 10:35:36,022 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:35:36 BoogieIcfgContainer [2024-11-19 10:35:36,022 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 10:35:36,025 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 10:35:36,025 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 10:35:36,029 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 10:35:36,029 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 10:35:35" (1/3) ... [2024-11-19 10:35:36,030 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c278d55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:35:36, skipping insertion in model container [2024-11-19 10:35:36,031 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:35:35" (2/3) ... [2024-11-19 10:35:36,031 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c278d55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:35:36, skipping insertion in model container [2024-11-19 10:35:36,031 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:35:36" (3/3) ... [2024-11-19 10:35:36,033 INFO L112 eAbstractionObserver]: Analyzing ICFG divbin_unwindbound20.i [2024-11-19 10:35:36,051 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 10:35:36,052 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-19 10:35:36,103 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 10:35:36,109 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;@21cfdd88, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 10:35:36,109 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-19 10:35:36,112 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 30 states have internal predecessors, (40), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 10:35:36,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-19 10:35:36,118 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:35:36,118 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:35:36,119 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-19 10:35:36,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:35:36,124 INFO L85 PathProgramCache]: Analyzing trace with hash -604571617, now seen corresponding path program 1 times [2024-11-19 10:35:36,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:35:36,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383257802] [2024-11-19 10:35:36,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:35:36,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:35:36,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:35:36,266 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 10:35:36,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:35:36,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383257802] [2024-11-19 10:35:36,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383257802] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:35:36,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [820659595] [2024-11-19 10:35:36,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:35:36,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:35:36,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:35:36,272 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 10:35:36,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 10:35:36,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:35:36,350 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 10:35:36,353 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:35:36,362 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 10:35:36,363 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 10:35:36,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [820659595] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:35:36,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 10:35:36,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-19 10:35:36,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715150134] [2024-11-19 10:35:36,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:35:36,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 10:35:36,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:35:36,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 10:35:36,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 10:35:36,390 INFO L87 Difference]: Start difference. First operand has 37 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 30 states have internal predecessors, (40), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 10:35:36,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:35:36,407 INFO L93 Difference]: Finished difference Result 70 states and 95 transitions. [2024-11-19 10:35:36,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 10:35:36,410 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 15 [2024-11-19 10:35:36,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:35:36,418 INFO L225 Difference]: With dead ends: 70 [2024-11-19 10:35:36,418 INFO L226 Difference]: Without dead ends: 29 [2024-11-19 10:35:36,423 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 10:35:36,428 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:35:36,428 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:35:36,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-19 10:35:36,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-19 10:35:36,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 20 states have (on average 1.35) internal successors, (27), 23 states have internal predecessors, (27), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 10:35:36,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2024-11-19 10:35:36,477 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 15 [2024-11-19 10:35:36,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:35:36,478 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2024-11-19 10:35:36,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 10:35:36,478 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2024-11-19 10:35:36,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-19 10:35:36,480 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:35:36,491 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:35:36,509 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-11-19 10:35:36,695 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,SelfDestructingSolverStorable0 [2024-11-19 10:35:36,696 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-19 10:35:36,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:35:36,697 INFO L85 PathProgramCache]: Analyzing trace with hash 153751263, now seen corresponding path program 1 times [2024-11-19 10:35:36,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:35:36,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107170681] [2024-11-19 10:35:36,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:35:36,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:35:36,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:35:36,799 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 10:35:36,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:35:36,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107170681] [2024-11-19 10:35:36,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107170681] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:35:36,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:35:36,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:35:36,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186848972] [2024-11-19 10:35:36,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:35:36,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:35:36,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:35:36,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:35:36,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:35:36,808 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 10:35:36,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:35:36,876 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2024-11-19 10:35:36,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:35:36,877 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 15 [2024-11-19 10:35:36,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:35:36,878 INFO L225 Difference]: With dead ends: 34 [2024-11-19 10:35:36,878 INFO L226 Difference]: Without dead ends: 33 [2024-11-19 10:35:36,878 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 10:35:36,879 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 18 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:35:36,880 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 61 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:35:36,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-19 10:35:36,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2024-11-19 10:35:36,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 20 states have (on average 1.3) internal successors, (26), 22 states have internal predecessors, (26), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 10:35:36,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2024-11-19 10:35:36,889 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 15 [2024-11-19 10:35:36,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:35:36,890 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2024-11-19 10:35:36,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 10:35:36,891 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2024-11-19 10:35:36,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-19 10:35:36,893 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:35:36,893 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:35:36,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 10:35:36,893 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-19 10:35:36,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:35:36,894 INFO L85 PathProgramCache]: Analyzing trace with hash 471321901, now seen corresponding path program 1 times [2024-11-19 10:35:36,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:35:36,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329254232] [2024-11-19 10:35:36,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:35:36,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:35:36,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:35:36,959 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 10:35:36,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:35:36,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329254232] [2024-11-19 10:35:36,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329254232] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:35:36,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:35:36,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:35:36,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461450441] [2024-11-19 10:35:36,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:35:36,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:35:36,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:35:36,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:35:36,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:35:36,962 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 10:35:36,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:35:36,992 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2024-11-19 10:35:36,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 10:35:36,993 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 16 [2024-11-19 10:35:36,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:35:36,994 INFO L225 Difference]: With dead ends: 46 [2024-11-19 10:35:36,994 INFO L226 Difference]: Without dead ends: 32 [2024-11-19 10:35:36,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 10:35:36,996 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 8 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:35:36,997 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 70 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:35:36,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-19 10:35:37,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-19 10:35:37,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.25) internal successors, (30), 26 states have internal predecessors, (30), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 10:35:37,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2024-11-19 10:35:37,002 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 16 [2024-11-19 10:35:37,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:35:37,002 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2024-11-19 10:35:37,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 10:35:37,002 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2024-11-19 10:35:37,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-19 10:35:37,003 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:35:37,003 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:35:37,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 10:35:37,004 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-19 10:35:37,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:35:37,004 INFO L85 PathProgramCache]: Analyzing trace with hash -2080735310, now seen corresponding path program 1 times [2024-11-19 10:35:37,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:35:37,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910470951] [2024-11-19 10:35:37,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:35:37,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:35:37,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:35:37,119 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 10:35:37,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:35:37,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910470951] [2024-11-19 10:35:37,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910470951] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:35:37,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:35:37,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 10:35:37,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377611687] [2024-11-19 10:35:37,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:35:37,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 10:35:37,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:35:37,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 10:35:37,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 10:35:37,123 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 10:35:37,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:35:37,210 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2024-11-19 10:35:37,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 10:35:37,213 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2024-11-19 10:35:37,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:35:37,214 INFO L225 Difference]: With dead ends: 32 [2024-11-19 10:35:37,214 INFO L226 Difference]: Without dead ends: 31 [2024-11-19 10:35:37,215 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-19 10:35:37,216 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 27 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:35:37,219 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 63 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:35:37,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-19 10:35:37,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-11-19 10:35:37,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 10:35:37,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2024-11-19 10:35:37,233 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 20 [2024-11-19 10:35:37,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:35:37,234 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2024-11-19 10:35:37,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 10:35:37,234 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2024-11-19 10:35:37,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-19 10:35:37,235 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:35:37,235 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:35:37,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 10:35:37,235 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-19 10:35:37,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:35:37,236 INFO L85 PathProgramCache]: Analyzing trace with hash -78285105, now seen corresponding path program 1 times [2024-11-19 10:35:37,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:35:37,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092786742] [2024-11-19 10:35:37,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:35:37,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:35:37,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:35:37,405 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 10:35:37,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:35:37,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092786742] [2024-11-19 10:35:37,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092786742] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:35:37,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:35:37,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 10:35:37,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794804143] [2024-11-19 10:35:37,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:35:37,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 10:35:37,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:35:37,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 10:35:37,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 10:35:37,410 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 10:35:37,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:35:37,509 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2024-11-19 10:35:37,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 10:35:37,514 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2024-11-19 10:35:37,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:35:37,515 INFO L225 Difference]: With dead ends: 41 [2024-11-19 10:35:37,515 INFO L226 Difference]: Without dead ends: 40 [2024-11-19 10:35:37,515 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-19 10:35:37,516 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 15 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:35:37,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 94 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:35:37,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-19 10:35:37,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 35. [2024-11-19 10:35:37,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 29 states have internal predecessors, (34), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 10:35:37,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2024-11-19 10:35:37,527 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 21 [2024-11-19 10:35:37,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:35:37,528 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2024-11-19 10:35:37,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 10:35:37,529 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2024-11-19 10:35:37,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-19 10:35:37,530 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:35:37,530 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:35:37,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 10:35:37,530 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-19 10:35:37,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:35:37,531 INFO L85 PathProgramCache]: Analyzing trace with hash -78246376, now seen corresponding path program 1 times [2024-11-19 10:35:37,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:35:37,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452845347] [2024-11-19 10:35:37,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:35:37,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:35:37,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:35:37,615 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 10:35:37,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:35:37,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452845347] [2024-11-19 10:35:37,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452845347] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:35:37,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526248592] [2024-11-19 10:35:37,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:35:37,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:35:37,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:35:37,621 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 10:35:37,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 10:35:37,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:35:37,674 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 10:35:37,676 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:35:37,747 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 10:35:37,747 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 10:35:37,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [526248592] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:35:37,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 10:35:37,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2024-11-19 10:35:37,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338137350] [2024-11-19 10:35:37,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:35:37,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 10:35:37,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:35:37,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 10:35:37,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-19 10:35:37,751 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 10:35:37,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:35:37,810 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2024-11-19 10:35:37,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 10:35:37,810 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2024-11-19 10:35:37,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:35:37,811 INFO L225 Difference]: With dead ends: 39 [2024-11-19 10:35:37,811 INFO L226 Difference]: Without dead ends: 38 [2024-11-19 10:35:37,812 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-19 10:35:37,812 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 17 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:35:37,813 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 78 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:35:37,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-19 10:35:37,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2024-11-19 10:35:37,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 10:35:37,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2024-11-19 10:35:37,819 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 21 [2024-11-19 10:35:37,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:35:37,819 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2024-11-19 10:35:37,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 10:35:37,820 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2024-11-19 10:35:37,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-19 10:35:37,820 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:35:37,820 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:35:37,840 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 10:35:38,024 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,SelfDestructingSolverStorable5 [2024-11-19 10:35:38,025 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-19 10:35:38,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:35:38,025 INFO L85 PathProgramCache]: Analyzing trace with hash 654806120, now seen corresponding path program 1 times [2024-11-19 10:35:38,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:35:38,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771094880] [2024-11-19 10:35:38,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:35:38,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:35:38,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:35:38,103 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 10:35:38,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:35:38,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771094880] [2024-11-19 10:35:38,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771094880] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:35:38,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1347245758] [2024-11-19 10:35:38,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:35:38,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:35:38,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:35:38,107 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-11-19 10:35:38,110 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-11-19 10:35:38,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:35:38,149 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 10:35:38,150 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:35:38,185 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 10:35:38,186 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:35:38,248 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 10:35:38,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1347245758] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 10:35:38,248 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 10:35:38,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 10 [2024-11-19 10:35:38,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349020469] [2024-11-19 10:35:38,249 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 10:35:38,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 10:35:38,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:35:38,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 10:35:38,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-19 10:35:38,251 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-19 10:35:38,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:35:38,387 INFO L93 Difference]: Finished difference Result 68 states and 79 transitions. [2024-11-19 10:35:38,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 10:35:38,388 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 25 [2024-11-19 10:35:38,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:35:38,390 INFO L225 Difference]: With dead ends: 68 [2024-11-19 10:35:38,390 INFO L226 Difference]: Without dead ends: 56 [2024-11-19 10:35:38,390 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2024-11-19 10:35:38,392 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 25 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:35:38,393 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 117 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:35:38,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-19 10:35:38,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 48. [2024-11-19 10:35:38,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 42 states have internal predecessors, (49), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 10:35:38,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2024-11-19 10:35:38,407 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 25 [2024-11-19 10:35:38,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:35:38,407 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2024-11-19 10:35:38,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-19 10:35:38,408 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2024-11-19 10:35:38,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-19 10:35:38,409 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:35:38,409 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:35:38,424 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-19 10:35:38,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:35:38,610 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-19 10:35:38,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:35:38,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1174269756, now seen corresponding path program 1 times [2024-11-19 10:35:38,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:35:38,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883372369] [2024-11-19 10:35:38,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:35:38,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:35:38,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:35:38,772 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 10:35:38,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:35:38,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883372369] [2024-11-19 10:35:38,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883372369] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:35:38,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206322587] [2024-11-19 10:35:38,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:35:38,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:35:38,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:35:38,775 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-11-19 10:35:38,776 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-11-19 10:35:38,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:35:38,822 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 10:35:38,824 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:35:38,904 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 10:35:38,904 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:35:39,004 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 10:35:39,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1206322587] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 10:35:39,005 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 10:35:39,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2024-11-19 10:35:39,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949732526] [2024-11-19 10:35:39,006 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 10:35:39,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-19 10:35:39,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:35:39,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-19 10:35:39,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2024-11-19 10:35:39,008 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand has 18 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 18 states have internal predecessors, (46), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 10:35:39,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:35:39,289 INFO L93 Difference]: Finished difference Result 77 states and 89 transitions. [2024-11-19 10:35:39,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-19 10:35:39,290 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 18 states have internal predecessors, (46), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 26 [2024-11-19 10:35:39,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:35:39,291 INFO L225 Difference]: With dead ends: 77 [2024-11-19 10:35:39,294 INFO L226 Difference]: Without dead ends: 76 [2024-11-19 10:35:39,295 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=259, Invalid=733, Unknown=0, NotChecked=0, Total=992 [2024-11-19 10:35:39,296 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 110 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:35:39,296 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 122 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:35:39,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-19 10:35:39,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 70. [2024-11-19 10:35:39,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 60 states have (on average 1.15) internal successors, (69), 60 states have internal predecessors, (69), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-19 10:35:39,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 79 transitions. [2024-11-19 10:35:39,312 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 79 transitions. Word has length 26 [2024-11-19 10:35:39,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:35:39,315 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 79 transitions. [2024-11-19 10:35:39,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 18 states have internal predecessors, (46), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 10:35:39,315 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 79 transitions. [2024-11-19 10:35:39,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-19 10:35:39,316 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:35:39,316 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:35:39,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-19 10:35:39,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:35:39,517 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-19 10:35:39,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:35:39,518 INFO L85 PathProgramCache]: Analyzing trace with hash 749470151, now seen corresponding path program 1 times [2024-11-19 10:35:39,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:35:39,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890648990] [2024-11-19 10:35:39,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:35:39,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:35:39,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:35:39,756 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-19 10:35:39,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:35:39,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890648990] [2024-11-19 10:35:39,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890648990] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:35:39,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [651519488] [2024-11-19 10:35:39,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:35:39,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:35:39,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:35:39,759 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-11-19 10:35:39,761 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-11-19 10:35:39,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:35:39,822 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 10:35:39,824 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:35:40,008 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 10:35:40,009 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:35:40,250 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-19 10:35:40,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [651519488] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 10:35:40,251 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 10:35:40,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 29 [2024-11-19 10:35:40,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663317459] [2024-11-19 10:35:40,252 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 10:35:40,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-19 10:35:40,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:35:40,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-19 10:35:40,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=658, Unknown=0, NotChecked=0, Total=870 [2024-11-19 10:35:40,254 INFO L87 Difference]: Start difference. First operand 70 states and 79 transitions. Second operand has 30 states, 29 states have (on average 3.3448275862068964) internal successors, (97), 30 states have internal predecessors, (97), 11 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-19 10:35:40,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:35:40,880 INFO L93 Difference]: Finished difference Result 223 states and 253 transitions. [2024-11-19 10:35:40,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-11-19 10:35:40,881 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.3448275862068964) internal successors, (97), 30 states have internal predecessors, (97), 11 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) Word has length 54 [2024-11-19 10:35:40,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:35:40,882 INFO L225 Difference]: With dead ends: 223 [2024-11-19 10:35:40,883 INFO L226 Difference]: Without dead ends: 222 [2024-11-19 10:35:40,884 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 599 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=896, Invalid=2296, Unknown=0, NotChecked=0, Total=3192 [2024-11-19 10:35:40,884 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 214 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 10:35:40,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 207 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 10:35:40,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-11-19 10:35:40,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 169. [2024-11-19 10:35:40,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 141 states have (on average 1.127659574468085) internal successors, (159), 141 states have internal predecessors, (159), 14 states have call successors, (14), 13 states have call predecessors, (14), 13 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-19 10:35:40,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 187 transitions. [2024-11-19 10:35:40,902 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 187 transitions. Word has length 54 [2024-11-19 10:35:40,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:35:40,903 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 187 transitions. [2024-11-19 10:35:40,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.3448275862068964) internal successors, (97), 30 states have internal predecessors, (97), 11 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-19 10:35:40,903 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 187 transitions. [2024-11-19 10:35:40,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-19 10:35:40,905 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:35:40,905 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:35:40,922 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-19 10:35:41,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:35:41,106 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-19 10:35:41,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:35:41,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1527022909, now seen corresponding path program 1 times [2024-11-19 10:35:41,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:35:41,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636308381] [2024-11-19 10:35:41,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:35:41,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:35:41,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:35:41,284 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-19 10:35:41,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:35:41,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636308381] [2024-11-19 10:35:41,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636308381] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:35:41,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [194420652] [2024-11-19 10:35:41,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:35:41,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:35:41,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:35:41,287 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-11-19 10:35:41,292 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-11-19 10:35:41,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:35:41,352 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-19 10:35:41,354 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:35:41,414 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-19 10:35:41,415 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:35:41,585 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-19 10:35:41,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [194420652] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 10:35:41,586 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 10:35:41,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 22 [2024-11-19 10:35:41,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210619008] [2024-11-19 10:35:41,586 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 10:35:41,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-19 10:35:41,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:35:41,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-19 10:35:41,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2024-11-19 10:35:41,588 INFO L87 Difference]: Start difference. First operand 169 states and 187 transitions. Second operand has 22 states, 22 states have (on average 3.3181818181818183) internal successors, (73), 22 states have internal predecessors, (73), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-19 10:35:41,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:35:41,930 INFO L93 Difference]: Finished difference Result 249 states and 281 transitions. [2024-11-19 10:35:41,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-19 10:35:41,930 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.3181818181818183) internal successors, (73), 22 states have internal predecessors, (73), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 62 [2024-11-19 10:35:41,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:35:41,932 INFO L225 Difference]: With dead ends: 249 [2024-11-19 10:35:41,932 INFO L226 Difference]: Without dead ends: 223 [2024-11-19 10:35:41,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=549, Invalid=1091, Unknown=0, NotChecked=0, Total=1640 [2024-11-19 10:35:41,934 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 89 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:35:41,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 183 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:35:41,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-11-19 10:35:41,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 199. [2024-11-19 10:35:41,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 171 states have (on average 1.1403508771929824) internal successors, (195), 171 states have internal predecessors, (195), 14 states have call successors, (14), 13 states have call predecessors, (14), 13 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-19 10:35:41,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 223 transitions. [2024-11-19 10:35:41,955 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 223 transitions. Word has length 62 [2024-11-19 10:35:41,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:35:41,955 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 223 transitions. [2024-11-19 10:35:41,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.3181818181818183) internal successors, (73), 22 states have internal predecessors, (73), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-19 10:35:41,958 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 223 transitions. [2024-11-19 10:35:41,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-19 10:35:41,960 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:35:41,960 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 10, 10, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:35:41,977 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-19 10:35:42,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:35:42,165 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-19 10:35:42,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:35:42,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1343796701, now seen corresponding path program 2 times [2024-11-19 10:35:42,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:35:42,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534313682] [2024-11-19 10:35:42,166 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 10:35:42,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:35:42,184 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 10:35:42,184 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 10:35:42,290 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2024-11-19 10:35:42,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:35:42,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534313682] [2024-11-19 10:35:42,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534313682] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:35:42,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:35:42,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 10:35:42,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924128028] [2024-11-19 10:35:42,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:35:42,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 10:35:42,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:35:42,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 10:35:42,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 10:35:42,293 INFO L87 Difference]: Start difference. First operand 199 states and 223 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 10:35:42,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:35:42,329 INFO L93 Difference]: Finished difference Result 225 states and 251 transitions. [2024-11-19 10:35:42,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 10:35:42,329 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 92 [2024-11-19 10:35:42,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:35:42,331 INFO L225 Difference]: With dead ends: 225 [2024-11-19 10:35:42,331 INFO L226 Difference]: Without dead ends: 199 [2024-11-19 10:35:42,331 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 10:35:42,332 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 2 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:35:42,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 94 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:35:42,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-11-19 10:35:42,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 155. [2024-11-19 10:35:42,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 127 states have (on average 1.1181102362204725) internal successors, (142), 127 states have internal predecessors, (142), 14 states have call successors, (14), 13 states have call predecessors, (14), 13 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-19 10:35:42,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 170 transitions. [2024-11-19 10:35:42,354 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 170 transitions. Word has length 92 [2024-11-19 10:35:42,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:35:42,355 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 170 transitions. [2024-11-19 10:35:42,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 10:35:42,356 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 170 transitions. [2024-11-19 10:35:42,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-19 10:35:42,358 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:35:42,358 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:35:42,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 10:35:42,358 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-19 10:35:42,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:35:42,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1694985668, now seen corresponding path program 1 times [2024-11-19 10:35:42,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:35:42,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895907727] [2024-11-19 10:35:42,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:35:42,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:35:42,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:35:43,020 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-11-19 10:35:43,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:35:43,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895907727] [2024-11-19 10:35:43,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895907727] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:35:43,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1625666523] [2024-11-19 10:35:43,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:35:43,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:35:43,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:35:43,024 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-11-19 10:35:43,025 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-11-19 10:35:43,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:35:43,103 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-19 10:35:43,107 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:35:43,724 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 3 proven. 334 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 10:35:43,725 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:35:44,597 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 3 proven. 222 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-11-19 10:35:44,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1625666523] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 10:35:44,597 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 10:35:44,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 65 [2024-11-19 10:35:44,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596044765] [2024-11-19 10:35:44,597 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 10:35:44,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2024-11-19 10:35:44,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:35:44,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2024-11-19 10:35:44,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=974, Invalid=3316, Unknown=0, NotChecked=0, Total=4290 [2024-11-19 10:35:44,602 INFO L87 Difference]: Start difference. First operand 155 states and 170 transitions. Second operand has 66 states, 65 states have (on average 3.3384615384615386) internal successors, (217), 66 states have internal predecessors, (217), 26 states have call successors, (28), 9 states have call predecessors, (28), 9 states have return successors, (28), 26 states have call predecessors, (28), 26 states have call successors, (28) [2024-11-19 10:35:46,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:35:46,521 INFO L93 Difference]: Finished difference Result 533 states and 600 transitions. [2024-11-19 10:35:46,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2024-11-19 10:35:46,522 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 65 states have (on average 3.3384615384615386) internal successors, (217), 66 states have internal predecessors, (217), 26 states have call successors, (28), 9 states have call predecessors, (28), 9 states have return successors, (28), 26 states have call predecessors, (28), 26 states have call successors, (28) Word has length 114 [2024-11-19 10:35:46,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:35:46,530 INFO L225 Difference]: With dead ends: 533 [2024-11-19 10:35:46,530 INFO L226 Difference]: Without dead ends: 532 [2024-11-19 10:35:46,535 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3568 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4405, Invalid=11597, Unknown=0, NotChecked=0, Total=16002 [2024-11-19 10:35:46,536 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 535 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 10:35:46,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [535 Valid, 305 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 10:35:46,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2024-11-19 10:35:46,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 325. [2024-11-19 10:35:46,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 267 states have (on average 1.1161048689138577) internal successors, (298), 267 states have internal predecessors, (298), 29 states have call successors, (29), 28 states have call predecessors, (29), 28 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-19 10:35:46,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 356 transitions. [2024-11-19 10:35:46,563 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 356 transitions. Word has length 114 [2024-11-19 10:35:46,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:35:46,564 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 356 transitions. [2024-11-19 10:35:46,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 65 states have (on average 3.3384615384615386) internal successors, (217), 66 states have internal predecessors, (217), 26 states have call successors, (28), 9 states have call predecessors, (28), 9 states have return successors, (28), 26 states have call predecessors, (28), 26 states have call successors, (28) [2024-11-19 10:35:46,564 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 356 transitions. [2024-11-19 10:35:46,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2024-11-19 10:35:46,569 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:35:46,570 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:35:46,589 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-19 10:35:46,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:35:46,774 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-19 10:35:46,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:35:46,775 INFO L85 PathProgramCache]: Analyzing trace with hash -2144432913, now seen corresponding path program 2 times [2024-11-19 10:35:46,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:35:46,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500421490] [2024-11-19 10:35:46,775 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 10:35:46,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:35:46,827 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 10:35:46,828 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 10:35:47,105 INFO L134 CoverageAnalysis]: Checked inductivity of 1756 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 1634 trivial. 0 not checked. [2024-11-19 10:35:47,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:35:47,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500421490] [2024-11-19 10:35:47,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500421490] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:35:47,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:35:47,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 10:35:47,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870262592] [2024-11-19 10:35:47,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:35:47,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 10:35:47,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:35:47,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 10:35:47,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 10:35:47,108 INFO L87 Difference]: Start difference. First operand 325 states and 356 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 10:35:47,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:35:47,160 INFO L93 Difference]: Finished difference Result 329 states and 360 transitions. [2024-11-19 10:35:47,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 10:35:47,160 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 229 [2024-11-19 10:35:47,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:35:47,161 INFO L225 Difference]: With dead ends: 329 [2024-11-19 10:35:47,161 INFO L226 Difference]: Without dead ends: 0 [2024-11-19 10:35:47,162 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 10:35:47,163 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 19 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:35:47,163 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 67 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:35:47,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-19 10:35:47,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-19 10:35:47,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:35:47,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-19 10:35:47,165 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 229 [2024-11-19 10:35:47,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:35:47,165 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 10:35:47,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 10:35:47,165 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-19 10:35:47,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-19 10:35:47,168 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-11-19 10:35:47,168 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-11-19 10:35:47,169 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-11-19 10:35:47,169 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-11-19 10:35:47,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 10:35:47,172 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:35:47,174 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-19 10:35:47,918 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 10:35:47,939 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 10:35:47 BoogieIcfgContainer [2024-11-19 10:35:47,939 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 10:35:47,940 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 10:35:47,940 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 10:35:47,941 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 10:35:47,941 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:35:36" (3/4) ... [2024-11-19 10:35:47,943 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-19 10:35:47,947 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-19 10:35:47,947 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-11-19 10:35:47,950 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-11-19 10:35:47,951 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-19 10:35:47,951 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-19 10:35:47,952 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-19 10:35:48,044 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 10:35:48,045 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-19 10:35:48,045 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 10:35:48,046 INFO L158 Benchmark]: Toolchain (without parser) took 12739.72ms. Allocated memory was 169.9MB in the beginning and 283.1MB in the end (delta: 113.2MB). Free memory was 112.4MB in the beginning and 199.7MB in the end (delta: -87.3MB). Peak memory consumption was 27.6MB. Max. memory is 16.1GB. [2024-11-19 10:35:48,046 INFO L158 Benchmark]: CDTParser took 2.05ms. Allocated memory is still 169.9MB. Free memory is still 136.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 10:35:48,046 INFO L158 Benchmark]: CACSL2BoogieTranslator took 248.07ms. Allocated memory is still 169.9MB. Free memory was 112.4MB in the beginning and 99.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-19 10:35:48,047 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.80ms. Allocated memory is still 169.9MB. Free memory was 99.7MB in the beginning and 98.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 10:35:48,047 INFO L158 Benchmark]: Boogie Preprocessor took 39.90ms. Allocated memory is still 169.9MB. Free memory was 98.3MB in the beginning and 96.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 10:35:48,048 INFO L158 Benchmark]: RCFGBuilder took 389.75ms. Allocated memory is still 169.9MB. Free memory was 96.6MB in the beginning and 84.6MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-19 10:35:48,048 INFO L158 Benchmark]: TraceAbstraction took 11914.34ms. Allocated memory was 169.9MB in the beginning and 283.1MB in the end (delta: 113.2MB). Free memory was 83.7MB in the beginning and 204.9MB in the end (delta: -121.2MB). Peak memory consumption was 118.3MB. Max. memory is 16.1GB. [2024-11-19 10:35:48,049 INFO L158 Benchmark]: Witness Printer took 105.26ms. Allocated memory is still 283.1MB. Free memory was 203.9MB in the beginning and 199.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 10:35:48,050 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 2.05ms. Allocated memory is still 169.9MB. Free memory is still 136.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 248.07ms. Allocated memory is still 169.9MB. Free memory was 112.4MB in the beginning and 99.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.80ms. Allocated memory is still 169.9MB. Free memory was 99.7MB in the beginning and 98.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.90ms. Allocated memory is still 169.9MB. Free memory was 98.3MB in the beginning and 96.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 389.75ms. Allocated memory is still 169.9MB. Free memory was 96.6MB in the beginning and 84.6MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 11914.34ms. Allocated memory was 169.9MB in the beginning and 283.1MB in the end (delta: 113.2MB). Free memory was 83.7MB in the beginning and 204.9MB in the end (delta: -121.2MB). Peak memory consumption was 118.3MB. Max. memory is 16.1GB. * Witness Printer took 105.26ms. Allocated memory is still 283.1MB. Free memory was 203.9MB in the beginning and 199.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 37 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 11.1s, OverallIterations: 13, TraceHistogramMax: 19, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1079 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1079 mSDsluCounter, 1503 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1173 mSDsCounter, 95 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 994 IncrementalHoareTripleChecker+Invalid, 1089 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 95 mSolverCounterUnsat, 330 mSDtfsCounter, 994 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 818 GetRequests, 516 SyntacticMatches, 0 SemanticMatches, 302 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4643 ImplicationChecksByTransitivity, 4.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=325occurred in iteration=12, InterpolantAutomatonStates: 248, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 356 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 1027 NumberOfCodeBlocks, 1027 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1283 ConstructedInterpolants, 0 QuantifiedInterpolants, 2457 SizeOfPredicates, 42 NumberOfNonLiveVariables, 791 ConjunctsInSsa, 59 ConjunctsInUnsatCore, 25 InterpolantComputations, 8 PerfectInterpolantSequences, 2446/3493 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 40]: Loop Invariant Derived loop invariant: (((1 <= counter) && (counter <= 20)) || ((21 <= counter) && (counter <= 2147483645))) - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: (((1 <= counter) && (counter <= 20)) || (counter == 0)) - ProcedureContractResult [Line: 15]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: (counter == 0) Ensures: ((counter == 0) && (counter == \old(counter))) - ProcedureContractResult [Line: 18]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Ensures: (counter == \old(counter)) RESULT: Ultimate proved your program to be correct! [2024-11-19 10:35:48,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE