./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Addition01-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Addition01-2.c -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 4af9e26294eb81d37b6ccb692d0b40e4bed5b0d6d3dd72d6af1a80634692c297 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 13:57:14,967 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 13:57:15,023 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-13 13:57:15,028 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 13:57:15,029 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 13:57:15,054 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 13:57:15,054 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 13:57:15,055 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 13:57:15,055 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 13:57:15,058 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 13:57:15,059 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 13:57:15,059 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 13:57:15,059 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 13:57:15,059 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 13:57:15,060 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 13:57:15,060 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 13:57:15,060 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 13:57:15,060 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 13:57:15,060 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 13:57:15,061 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 13:57:15,061 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 13:57:15,062 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 13:57:15,062 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 13:57:15,062 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 13:57:15,062 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 13:57:15,063 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-13 13:57:15,063 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 13:57:15,063 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 13:57:15,063 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 13:57:15,063 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 13:57:15,064 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 13:57:15,064 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 13:57:15,064 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 13:57:15,064 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 13:57:15,064 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 13:57:15,064 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 13:57:15,065 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 13:57:15,065 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 13:57:15,065 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 13:57:15,065 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 13:57:15,065 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 13:57:15,066 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 13:57:15,066 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 13:57:15,066 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 13:57:15,066 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 -> 4af9e26294eb81d37b6ccb692d0b40e4bed5b0d6d3dd72d6af1a80634692c297 [2024-10-13 13:57:15,271 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 13:57:15,292 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 13:57:15,296 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 13:57:15,297 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 13:57:15,297 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 13:57:15,299 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Addition01-2.c [2024-10-13 13:57:16,595 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 13:57:16,721 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 13:57:16,722 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Addition01-2.c [2024-10-13 13:57:16,727 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b28470bc/b4c06b542c57442e86941b33cab01495/FLAG9e6d3ad20 [2024-10-13 13:57:16,742 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b28470bc/b4c06b542c57442e86941b33cab01495 [2024-10-13 13:57:16,744 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 13:57:16,745 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 13:57:16,746 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 13:57:16,746 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 13:57:16,750 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 13:57:16,751 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:57:16" (1/1) ... [2024-10-13 13:57:16,751 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61359d2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:57:16, skipping insertion in model container [2024-10-13 13:57:16,751 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:57:16" (1/1) ... [2024-10-13 13:57:16,773 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 13:57:16,903 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 13:57:16,936 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 13:57:16,949 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 13:57:16,961 INFO L204 MainTranslator]: Completed translation [2024-10-13 13:57:16,962 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:57:16 WrapperNode [2024-10-13 13:57:16,962 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 13:57:16,980 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 13:57:16,980 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 13:57:16,980 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 13:57:16,985 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:57:16" (1/1) ... [2024-10-13 13:57:16,990 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:57:16" (1/1) ... [2024-10-13 13:57:17,000 INFO L138 Inliner]: procedures = 13, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 36 [2024-10-13 13:57:17,001 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 13:57:17,001 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 13:57:17,001 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 13:57:17,001 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 13:57:17,012 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:57:16" (1/1) ... [2024-10-13 13:57:17,012 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:57:16" (1/1) ... [2024-10-13 13:57:17,013 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:57:16" (1/1) ... [2024-10-13 13:57:17,022 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 13:57:17,022 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:57:16" (1/1) ... [2024-10-13 13:57:17,023 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:57:16" (1/1) ... [2024-10-13 13:57:17,024 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:57:16" (1/1) ... [2024-10-13 13:57:17,026 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:57:16" (1/1) ... [2024-10-13 13:57:17,026 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:57:16" (1/1) ... [2024-10-13 13:57:17,027 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:57:16" (1/1) ... [2024-10-13 13:57:17,028 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 13:57:17,028 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 13:57:17,028 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 13:57:17,029 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 13:57:17,032 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:57:16" (1/1) ... [2024-10-13 13:57:17,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 13:57:17,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:57:17,063 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 13:57:17,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 13:57:17,102 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 13:57:17,102 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 13:57:17,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 13:57:17,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 13:57:17,103 INFO L130 BoogieDeclarations]: Found specification of procedure addition [2024-10-13 13:57:17,103 INFO L138 BoogieDeclarations]: Found implementation of procedure addition [2024-10-13 13:57:17,149 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 13:57:17,151 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 13:57:17,300 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2024-10-13 13:57:17,301 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 13:57:17,326 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 13:57:17,327 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-13 13:57:17,327 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:57:17 BoogieIcfgContainer [2024-10-13 13:57:17,328 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 13:57:17,330 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 13:57:17,330 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 13:57:17,333 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 13:57:17,333 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 01:57:16" (1/3) ... [2024-10-13 13:57:17,334 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43c1f20e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:57:17, skipping insertion in model container [2024-10-13 13:57:17,335 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:57:16" (2/3) ... [2024-10-13 13:57:17,335 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43c1f20e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:57:17, skipping insertion in model container [2024-10-13 13:57:17,335 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:57:17" (3/3) ... [2024-10-13 13:57:17,337 INFO L112 eAbstractionObserver]: Analyzing ICFG Addition01-2.c [2024-10-13 13:57:17,349 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 13:57:17,350 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2024-10-13 13:57:17,403 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 13:57:17,408 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;@77bb5a2f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 13:57:17,408 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2024-10-13 13:57:17,411 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 33 states have internal predecessors, (39), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-13 13:57:17,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-13 13:57:17,420 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:57:17,421 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:57:17,421 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-13 13:57:17,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:57:17,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1442933594, now seen corresponding path program 1 times [2024-10-13 13:57:17,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:57:17,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380933862] [2024-10-13 13:57:17,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:57:17,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:57:17,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:57:17,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:57:17,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:57:17,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380933862] [2024-10-13 13:57:17,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380933862] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:57:17,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:57:17,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 13:57:17,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189294870] [2024-10-13 13:57:17,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:57:17,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 13:57:17,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:57:17,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 13:57:17,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 13:57:17,638 INFO L87 Difference]: Start difference. First operand has 38 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 33 states have internal predecessors, (39), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:57:17,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:57:17,769 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2024-10-13 13:57:17,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 13:57:17,771 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-13 13:57:17,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:57:17,779 INFO L225 Difference]: With dead ends: 69 [2024-10-13 13:57:17,779 INFO L226 Difference]: Without dead ends: 61 [2024-10-13 13:57:17,781 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-10-13 13:57:17,785 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 46 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 13:57:17,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 105 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 13:57:17,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-10-13 13:57:17,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 53. [2024-10-13 13:57:17,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 36 states have (on average 1.5833333333333333) internal successors, (57), 45 states have internal predecessors, (57), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-13 13:57:17,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 67 transitions. [2024-10-13 13:57:17,823 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 67 transitions. Word has length 8 [2024-10-13 13:57:17,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:57:17,824 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 67 transitions. [2024-10-13 13:57:17,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:57:17,825 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 67 transitions. [2024-10-13 13:57:17,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-13 13:57:17,826 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:57:17,826 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:57:17,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 13:57:17,827 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting additionErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-13 13:57:17,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:57:17,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1781268526, now seen corresponding path program 1 times [2024-10-13 13:57:17,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:57:17,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247439361] [2024-10-13 13:57:17,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:57:17,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:57:17,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:57:17,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:57:17,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:57:17,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247439361] [2024-10-13 13:57:17,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247439361] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:57:17,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:57:17,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 13:57:17,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023305853] [2024-10-13 13:57:17,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:57:17,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 13:57:17,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:57:17,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 13:57:17,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 13:57:17,918 INFO L87 Difference]: Start difference. First operand 53 states and 67 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:57:18,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:57:18,029 INFO L93 Difference]: Finished difference Result 101 states and 130 transitions. [2024-10-13 13:57:18,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 13:57:18,030 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-13 13:57:18,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:57:18,032 INFO L225 Difference]: With dead ends: 101 [2024-10-13 13:57:18,036 INFO L226 Difference]: Without dead ends: 99 [2024-10-13 13:57:18,036 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-10-13 13:57:18,037 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 43 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 13:57:18,038 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 99 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 13:57:18,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-13 13:57:18,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 89. [2024-10-13 13:57:18,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 66 states have (on average 1.5606060606060606) internal successors, (103), 75 states have internal predecessors, (103), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 13:57:18,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 121 transitions. [2024-10-13 13:57:18,081 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 121 transitions. Word has length 9 [2024-10-13 13:57:18,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:57:18,082 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 121 transitions. [2024-10-13 13:57:18,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:57:18,085 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 121 transitions. [2024-10-13 13:57:18,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-13 13:57:18,085 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:57:18,085 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:57:18,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 13:57:18,086 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-13 13:57:18,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:57:18,086 INFO L85 PathProgramCache]: Analyzing trace with hash -615375333, now seen corresponding path program 1 times [2024-10-13 13:57:18,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:57:18,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943443955] [2024-10-13 13:57:18,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:57:18,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:57:18,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:57:18,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-13 13:57:18,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:57:18,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:57:18,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:57:18,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943443955] [2024-10-13 13:57:18,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943443955] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:57:18,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:57:18,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 13:57:18,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985855470] [2024-10-13 13:57:18,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:57:18,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 13:57:18,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:57:18,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 13:57:18,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 13:57:18,157 INFO L87 Difference]: Start difference. First operand 89 states and 121 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, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 13:57:18,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:57:18,188 INFO L93 Difference]: Finished difference Result 89 states and 121 transitions. [2024-10-13 13:57:18,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 13:57:18,188 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, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-10-13 13:57:18,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:57:18,189 INFO L225 Difference]: With dead ends: 89 [2024-10-13 13:57:18,189 INFO L226 Difference]: Without dead ends: 88 [2024-10-13 13:57:18,190 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 13:57:18,191 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 4 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:57:18,191 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 97 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:57:18,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-13 13:57:18,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-10-13 13:57:18,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 66 states have (on average 1.5454545454545454) internal successors, (102), 74 states have internal predecessors, (102), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 13:57:18,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 120 transitions. [2024-10-13 13:57:18,207 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 120 transitions. Word has length 10 [2024-10-13 13:57:18,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:57:18,208 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 120 transitions. [2024-10-13 13:57:18,208 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, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 13:57:18,208 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 120 transitions. [2024-10-13 13:57:18,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-13 13:57:18,209 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:57:18,209 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:57:18,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 13:57:18,209 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting additionErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-13 13:57:18,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:57:18,210 INFO L85 PathProgramCache]: Analyzing trace with hash -615250468, now seen corresponding path program 1 times [2024-10-13 13:57:18,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:57:18,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502508283] [2024-10-13 13:57:18,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:57:18,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:57:18,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:57:18,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:57:18,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:57:18,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502508283] [2024-10-13 13:57:18,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502508283] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:57:18,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:57:18,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 13:57:18,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029198642] [2024-10-13 13:57:18,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:57:18,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 13:57:18,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:57:18,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 13:57:18,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 13:57:18,250 INFO L87 Difference]: Start difference. First operand 88 states and 120 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:57:18,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:57:18,272 INFO L93 Difference]: Finished difference Result 96 states and 133 transitions. [2024-10-13 13:57:18,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 13:57:18,273 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-13 13:57:18,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:57:18,274 INFO L225 Difference]: With dead ends: 96 [2024-10-13 13:57:18,274 INFO L226 Difference]: Without dead ends: 95 [2024-10-13 13:57:18,275 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 13:57:18,276 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 6 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:57:18,276 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 55 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:57:18,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-10-13 13:57:18,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 87. [2024-10-13 13:57:18,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 66 states have (on average 1.4848484848484849) internal successors, (98), 73 states have internal predecessors, (98), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 13:57:18,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 116 transitions. [2024-10-13 13:57:18,284 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 116 transitions. Word has length 10 [2024-10-13 13:57:18,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:57:18,284 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 116 transitions. [2024-10-13 13:57:18,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:57:18,284 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 116 transitions. [2024-10-13 13:57:18,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-13 13:57:18,285 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:57:18,285 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:57:18,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 13:57:18,285 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-13 13:57:18,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:57:18,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1896766091, now seen corresponding path program 1 times [2024-10-13 13:57:18,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:57:18,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316072929] [2024-10-13 13:57:18,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:57:18,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:57:18,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:57:18,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-13 13:57:18,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:57:18,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:57:18,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:57:18,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316072929] [2024-10-13 13:57:18,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316072929] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:57:18,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:57:18,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 13:57:18,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812183369] [2024-10-13 13:57:18,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:57:18,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 13:57:18,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:57:18,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 13:57:18,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 13:57:18,336 INFO L87 Difference]: Start difference. First operand 87 states and 116 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, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 13:57:18,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:57:18,355 INFO L93 Difference]: Finished difference Result 87 states and 116 transitions. [2024-10-13 13:57:18,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 13:57:18,356 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, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-10-13 13:57:18,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:57:18,356 INFO L225 Difference]: With dead ends: 87 [2024-10-13 13:57:18,356 INFO L226 Difference]: Without dead ends: 67 [2024-10-13 13:57:18,357 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 13:57:18,358 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 3 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:57:18,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 94 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:57:18,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-13 13:57:18,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 53. [2024-10-13 13:57:18,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 41 states have (on average 1.4146341463414633) internal successors, (58), 48 states have internal predecessors, (58), 5 states have call successors, (5), 4 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:57:18,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2024-10-13 13:57:18,363 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 11 [2024-10-13 13:57:18,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:57:18,364 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2024-10-13 13:57:18,364 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, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 13:57:18,364 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2024-10-13 13:57:18,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-13 13:57:18,365 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:57:18,365 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:57:18,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 13:57:18,365 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting additionErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-13 13:57:18,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:57:18,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1882367109, now seen corresponding path program 1 times [2024-10-13 13:57:18,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:57:18,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882197907] [2024-10-13 13:57:18,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:57:18,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:57:18,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:57:18,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:57:18,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:57:18,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882197907] [2024-10-13 13:57:18,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882197907] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:57:18,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:57:18,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 13:57:18,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914975908] [2024-10-13 13:57:18,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:57:18,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 13:57:18,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:57:18,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 13:57:18,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 13:57:18,400 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand has 5 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:57:18,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:57:18,432 INFO L93 Difference]: Finished difference Result 78 states and 89 transitions. [2024-10-13 13:57:18,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 13:57:18,433 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-10-13 13:57:18,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:57:18,433 INFO L225 Difference]: With dead ends: 78 [2024-10-13 13:57:18,433 INFO L226 Difference]: Without dead ends: 44 [2024-10-13 13:57:18,434 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-10-13 13:57:18,434 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 20 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:57:18,435 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 59 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:57:18,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-13 13:57:18,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2024-10-13 13:57:18,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 36 states have internal predecessors, (40), 4 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:57:18,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2024-10-13 13:57:18,438 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 11 [2024-10-13 13:57:18,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:57:18,438 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2024-10-13 13:57:18,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:57:18,438 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2024-10-13 13:57:18,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-13 13:57:18,439 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:57:18,439 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:57:18,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 13:57:18,439 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting additionErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-13 13:57:18,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:57:18,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1892895248, now seen corresponding path program 1 times [2024-10-13 13:57:18,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:57:18,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301493596] [2024-10-13 13:57:18,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:57:18,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:57:18,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:57:18,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:57:18,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:57:18,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301493596] [2024-10-13 13:57:18,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301493596] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:57:18,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:57:18,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 13:57:18,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088940224] [2024-10-13 13:57:18,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:57:18,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 13:57:18,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:57:18,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 13:57:18,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 13:57:18,470 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 5 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:57:18,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:57:18,507 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2024-10-13 13:57:18,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 13:57:18,507 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-10-13 13:57:18,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:57:18,508 INFO L225 Difference]: With dead ends: 48 [2024-10-13 13:57:18,508 INFO L226 Difference]: Without dead ends: 46 [2024-10-13 13:57:18,508 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-10-13 13:57:18,509 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 32 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:57:18,509 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 47 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:57:18,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-13 13:57:18,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2024-10-13 13:57:18,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 35 states have internal predecessors, (38), 4 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:57:18,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2024-10-13 13:57:18,512 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 11 [2024-10-13 13:57:18,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:57:18,513 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2024-10-13 13:57:18,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:57:18,513 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2024-10-13 13:57:18,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-13 13:57:18,513 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:57:18,513 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:57:18,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 13:57:18,514 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting additionErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-13 13:57:18,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:57:18,514 INFO L85 PathProgramCache]: Analyzing trace with hash -2031565807, now seen corresponding path program 1 times [2024-10-13 13:57:18,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:57:18,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538232156] [2024-10-13 13:57:18,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:57:18,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:57:18,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:57:18,575 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:57:18,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:57:18,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538232156] [2024-10-13 13:57:18,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538232156] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 13:57:18,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851050764] [2024-10-13 13:57:18,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:57:18,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:57:18,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:57:18,578 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 13:57:18,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 13:57:18,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:57:18,616 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 13:57:18,619 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:57:18,708 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:57:18,708 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 13:57:18,776 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:57:18,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1851050764] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 13:57:18,777 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 13:57:18,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-10-13 13:57:18,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405906239] [2024-10-13 13:57:18,777 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 13:57:18,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 13:57:18,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:57:18,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 13:57:18,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-10-13 13:57:18,779 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:57:18,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:57:18,892 INFO L93 Difference]: Finished difference Result 146 states and 165 transitions. [2024-10-13 13:57:18,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 13:57:18,892 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-10-13 13:57:18,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:57:18,893 INFO L225 Difference]: With dead ends: 146 [2024-10-13 13:57:18,893 INFO L226 Difference]: Without dead ends: 144 [2024-10-13 13:57:18,894 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2024-10-13 13:57:18,894 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 153 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 13:57:18,897 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 138 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 13:57:18,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-10-13 13:57:18,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 108. [2024-10-13 13:57:18,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 90 states have (on average 1.3) internal successors, (117), 97 states have internal predecessors, (117), 12 states have call successors, (12), 10 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:57:18,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 129 transitions. [2024-10-13 13:57:18,907 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 129 transitions. Word has length 17 [2024-10-13 13:57:18,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:57:18,908 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 129 transitions. [2024-10-13 13:57:18,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:57:18,908 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 129 transitions. [2024-10-13 13:57:18,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-13 13:57:18,909 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:57:18,909 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:57:18,926 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 13:57:19,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:57:19,114 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting additionErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-13 13:57:19,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:57:19,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1885909662, now seen corresponding path program 1 times [2024-10-13 13:57:19,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:57:19,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622408755] [2024-10-13 13:57:19,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:57:19,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:57:19,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:57:19,175 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:57:19,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:57:19,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622408755] [2024-10-13 13:57:19,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622408755] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:57:19,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:57:19,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 13:57:19,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558648637] [2024-10-13 13:57:19,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:57:19,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 13:57:19,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:57:19,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 13:57:19,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 13:57:19,177 INFO L87 Difference]: Start difference. First operand 108 states and 129 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:57:19,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:57:19,206 INFO L93 Difference]: Finished difference Result 109 states and 129 transitions. [2024-10-13 13:57:19,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 13:57:19,207 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-10-13 13:57:19,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:57:19,207 INFO L225 Difference]: With dead ends: 109 [2024-10-13 13:57:19,208 INFO L226 Difference]: Without dead ends: 42 [2024-10-13 13:57:19,208 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-13 13:57:19,209 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 10 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:57:19,209 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 23 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:57:19,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-13 13:57:19,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-10-13 13:57:19,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 5 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:57:19,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2024-10-13 13:57:19,213 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 19 [2024-10-13 13:57:19,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:57:19,213 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2024-10-13 13:57:19,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:57:19,213 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2024-10-13 13:57:19,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-13 13:57:19,218 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:57:19,218 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2024-10-13 13:57:19,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 13:57:19,219 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting additionErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-13 13:57:19,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:57:19,219 INFO L85 PathProgramCache]: Analyzing trace with hash 2056232378, now seen corresponding path program 2 times [2024-10-13 13:57:19,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:57:19,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805666520] [2024-10-13 13:57:19,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:57:19,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:57:19,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:57:19,387 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:57:19,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:57:19,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805666520] [2024-10-13 13:57:19,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805666520] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 13:57:19,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113416563] [2024-10-13 13:57:19,388 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 13:57:19,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:57:19,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:57:19,390 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 13:57:19,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 13:57:19,429 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 13:57:19,429 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 13:57:19,430 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-13 13:57:19,431 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:57:19,494 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:57:19,494 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 13:57:19,645 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:57:19,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [113416563] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 13:57:19,646 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 13:57:19,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2024-10-13 13:57:19,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119831004] [2024-10-13 13:57:19,646 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 13:57:19,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-13 13:57:19,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:57:19,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-13 13:57:19,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2024-10-13 13:57:19,647 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand has 24 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 14 states have internal predecessors, (71), 10 states have call successors, (10), 10 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:57:19,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:57:19,808 INFO L93 Difference]: Finished difference Result 94 states and 99 transitions. [2024-10-13 13:57:19,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-13 13:57:19,808 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 14 states have internal predecessors, (71), 10 states have call successors, (10), 10 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-10-13 13:57:19,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:57:19,809 INFO L225 Difference]: With dead ends: 94 [2024-10-13 13:57:19,809 INFO L226 Difference]: Without dead ends: 93 [2024-10-13 13:57:19,810 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=311, Invalid=811, Unknown=0, NotChecked=0, Total=1122 [2024-10-13 13:57:19,810 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 155 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 13:57:19,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 116 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 13:57:19,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-13 13:57:19,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 90. [2024-10-13 13:57:19,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 78 states have (on average 1.0128205128205128) internal successors, (79), 78 states have internal predecessors, (79), 11 states have call successors, (11), 11 states have call predecessors, (11), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:57:19,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2024-10-13 13:57:19,823 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 41 [2024-10-13 13:57:19,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:57:19,823 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2024-10-13 13:57:19,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 14 states have internal predecessors, (71), 10 states have call successors, (10), 10 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:57:19,823 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2024-10-13 13:57:19,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-13 13:57:19,825 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:57:19,825 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1] [2024-10-13 13:57:19,838 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-13 13:57:20,025 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,SelfDestructingSolverStorable9 [2024-10-13 13:57:20,026 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting additionErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-13 13:57:20,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:57:20,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1234841588, now seen corresponding path program 3 times [2024-10-13 13:57:20,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:57:20,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541521693] [2024-10-13 13:57:20,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:57:20,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:57:20,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:57:20,449 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 0 proven. 410 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:57:20,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:57:20,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541521693] [2024-10-13 13:57:20,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541521693] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 13:57:20,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [145751295] [2024-10-13 13:57:20,451 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 13:57:20,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:57:20,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:57:20,453 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 13:57:20,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-13 13:57:20,503 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-10-13 13:57:20,504 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 13:57:20,504 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-13 13:57:20,507 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:57:20,597 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 0 proven. 410 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:57:20,597 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 13:57:21,126 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 0 proven. 410 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:57:21,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [145751295] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 13:57:21,127 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 13:57:21,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2024-10-13 13:57:21,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429211370] [2024-10-13 13:57:21,127 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 13:57:21,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-10-13 13:57:21,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:57:21,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-10-13 13:57:21,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=556, Invalid=1700, Unknown=0, NotChecked=0, Total=2256 [2024-10-13 13:57:21,129 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand has 48 states, 47 states have (on average 3.297872340425532) internal successors, (155), 26 states have internal predecessors, (155), 22 states have call successors, (22), 22 states have call predecessors, (22), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:57:21,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:57:21,564 INFO L93 Difference]: Finished difference Result 190 states and 201 transitions. [2024-10-13 13:57:21,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-10-13 13:57:21,565 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 3.297872340425532) internal successors, (155), 26 states have internal predecessors, (155), 22 states have call successors, (22), 22 states have call predecessors, (22), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2024-10-13 13:57:21,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:57:21,566 INFO L225 Difference]: With dead ends: 190 [2024-10-13 13:57:21,566 INFO L226 Difference]: Without dead ends: 189 [2024-10-13 13:57:21,567 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1337, Invalid=3493, Unknown=0, NotChecked=0, Total=4830 [2024-10-13 13:57:21,568 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 428 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 13:57:21,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 215 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 13:57:21,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-10-13 13:57:21,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 186. [2024-10-13 13:57:21,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 162 states have (on average 1.0061728395061729) internal successors, (163), 162 states have internal predecessors, (163), 23 states have call successors, (23), 23 states have call predecessors, (23), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:57:21,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 186 transitions. [2024-10-13 13:57:21,599 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 186 transitions. Word has length 89 [2024-10-13 13:57:21,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:57:21,599 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 186 transitions. [2024-10-13 13:57:21,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 3.297872340425532) internal successors, (155), 26 states have internal predecessors, (155), 22 states have call successors, (22), 22 states have call predecessors, (22), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:57:21,599 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 186 transitions. [2024-10-13 13:57:21,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-10-13 13:57:21,603 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:57:21,603 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 23, 22, 22, 22, 22, 1, 1, 1, 1, 1] [2024-10-13 13:57:21,617 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-13 13:57:21,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:57:21,809 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting additionErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-13 13:57:21,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:57:21,809 INFO L85 PathProgramCache]: Analyzing trace with hash 756035760, now seen corresponding path program 4 times [2024-10-13 13:57:21,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:57:21,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553814639] [2024-10-13 13:57:21,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:57:21,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:57:21,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:57:23,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1958 backedges. 0 proven. 1958 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:57:23,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:57:23,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553814639] [2024-10-13 13:57:23,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553814639] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 13:57:23,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568241297] [2024-10-13 13:57:23,110 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-13 13:57:23,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:57:23,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:57:23,111 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 13:57:23,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-13 13:57:23,172 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-13 13:57:23,172 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 13:57:23,174 INFO L255 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-10-13 13:57:23,177 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:57:23,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1958 backedges. 0 proven. 1958 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:57:23,375 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 13:57:25,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1958 backedges. 0 proven. 1958 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:57:25,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1568241297] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 13:57:25,153 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 13:57:25,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2024-10-13 13:57:25,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493507223] [2024-10-13 13:57:25,153 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 13:57:25,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2024-10-13 13:57:25,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:57:25,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2024-10-13 13:57:25,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2260, Invalid=6860, Unknown=0, NotChecked=0, Total=9120 [2024-10-13 13:57:25,162 INFO L87 Difference]: Start difference. First operand 186 states and 186 transitions. Second operand has 96 states, 95 states have (on average 3.4) internal successors, (323), 50 states have internal predecessors, (323), 46 states have call successors, (46), 46 states have call predecessors, (46), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:57:26,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:57:26,746 INFO L93 Difference]: Finished difference Result 382 states and 405 transitions. [2024-10-13 13:57:26,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2024-10-13 13:57:26,747 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 95 states have (on average 3.4) internal successors, (323), 50 states have internal predecessors, (323), 46 states have call successors, (46), 46 states have call predecessors, (46), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 185 [2024-10-13 13:57:26,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:57:26,749 INFO L225 Difference]: With dead ends: 382 [2024-10-13 13:57:26,749 INFO L226 Difference]: Without dead ends: 381 [2024-10-13 13:57:26,753 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 322 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4140 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=5549, Invalid=14473, Unknown=0, NotChecked=0, Total=20022 [2024-10-13 13:57:26,753 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 1079 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1079 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 13:57:26,753 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1079 Valid, 416 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 13:57:26,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2024-10-13 13:57:26,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 378. [2024-10-13 13:57:26,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 330 states have (on average 1.003030303030303) internal successors, (331), 330 states have internal predecessors, (331), 47 states have call successors, (47), 47 states have call predecessors, (47), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:57:26,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 378 transitions. [2024-10-13 13:57:26,767 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 378 transitions. Word has length 185 [2024-10-13 13:57:26,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:57:26,767 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 378 transitions. [2024-10-13 13:57:26,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 95 states have (on average 3.4) internal successors, (323), 50 states have internal predecessors, (323), 46 states have call successors, (46), 46 states have call predecessors, (46), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:57:26,768 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 378 transitions. [2024-10-13 13:57:26,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2024-10-13 13:57:26,775 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:57:26,775 INFO L215 NwaCegarLoop]: trace histogram [47, 47, 47, 47, 46, 46, 46, 46, 1, 1, 1, 1, 1] [2024-10-13 13:57:26,792 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-13 13:57:26,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:57:26,976 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting additionErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-13 13:57:26,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:57:26,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1522736648, now seen corresponding path program 5 times [2024-10-13 13:57:26,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:57:26,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175825106] [2024-10-13 13:57:26,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:57:26,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:57:27,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:57:31,002 INFO L134 CoverageAnalysis]: Checked inductivity of 8510 backedges. 0 proven. 8510 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:57:31,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:57:31,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175825106] [2024-10-13 13:57:31,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175825106] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 13:57:31,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [542037936] [2024-10-13 13:57:31,003 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-13 13:57:31,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:57:31,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:57:31,005 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 13:57:31,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-13 13:57:31,156 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2024-10-13 13:57:31,156 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 13:57:31,159 INFO L255 TraceCheckSpWp]: Trace formula consists of 779 conjuncts, 96 conjuncts are in the unsatisfiable core [2024-10-13 13:57:31,166 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:57:31,505 INFO L134 CoverageAnalysis]: Checked inductivity of 8510 backedges. 0 proven. 8510 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:57:31,506 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 13:57:37,484 INFO L134 CoverageAnalysis]: Checked inductivity of 8510 backedges. 0 proven. 8510 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:57:37,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [542037936] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 13:57:37,484 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 13:57:37,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2024-10-13 13:57:37,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150037194] [2024-10-13 13:57:37,484 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 13:57:37,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 192 states [2024-10-13 13:57:37,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:57:37,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2024-10-13 13:57:37,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9124, Invalid=27548, Unknown=0, NotChecked=0, Total=36672 [2024-10-13 13:57:37,493 INFO L87 Difference]: Start difference. First operand 378 states and 378 transitions. Second operand has 192 states, 191 states have (on average 3.450261780104712) internal successors, (659), 98 states have internal predecessors, (659), 94 states have call successors, (94), 94 states have call predecessors, (94), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:57:43,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:57:43,749 INFO L93 Difference]: Finished difference Result 766 states and 813 transitions. [2024-10-13 13:57:43,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2024-10-13 13:57:43,750 INFO L78 Accepts]: Start accepts. Automaton has has 192 states, 191 states have (on average 3.450261780104712) internal successors, (659), 98 states have internal predecessors, (659), 94 states have call successors, (94), 94 states have call predecessors, (94), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 377 [2024-10-13 13:57:43,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:57:43,753 INFO L225 Difference]: With dead ends: 766 [2024-10-13 13:57:43,753 INFO L226 Difference]: Without dead ends: 765 [2024-10-13 13:57:43,758 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 942 GetRequests, 658 SyntacticMatches, 0 SemanticMatches, 284 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17484 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=22613, Invalid=58897, Unknown=0, NotChecked=0, Total=81510 [2024-10-13 13:57:43,760 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 3508 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3508 SdHoareTripleChecker+Valid, 794 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 13:57:43,760 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3508 Valid, 794 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 682 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 13:57:43,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2024-10-13 13:57:43,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 762. [2024-10-13 13:57:43,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 762 states, 666 states have (on average 1.0015015015015014) internal successors, (667), 666 states have internal predecessors, (667), 95 states have call successors, (95), 95 states have call predecessors, (95), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:57:43,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 762 transitions. [2024-10-13 13:57:43,787 INFO L78 Accepts]: Start accepts. Automaton has 762 states and 762 transitions. Word has length 377 [2024-10-13 13:57:43,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:57:43,787 INFO L471 AbstractCegarLoop]: Abstraction has 762 states and 762 transitions. [2024-10-13 13:57:43,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 192 states, 191 states have (on average 3.450261780104712) internal successors, (659), 98 states have internal predecessors, (659), 94 states have call successors, (94), 94 states have call predecessors, (94), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:57:43,788 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 762 transitions. [2024-10-13 13:57:43,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 762 [2024-10-13 13:57:43,812 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:57:43,812 INFO L215 NwaCegarLoop]: trace histogram [95, 95, 95, 95, 94, 94, 94, 94, 1, 1, 1, 1, 1] [2024-10-13 13:57:43,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-13 13:57:44,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-13 13:57:44,013 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting additionErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-13 13:57:44,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:57:44,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1208613752, now seen corresponding path program 6 times [2024-10-13 13:57:44,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:57:44,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922359464] [2024-10-13 13:57:44,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:57:44,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:57:44,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:58:02,135 INFO L134 CoverageAnalysis]: Checked inductivity of 35438 backedges. 0 proven. 35438 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:58:02,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:58:02,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922359464] [2024-10-13 13:58:02,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922359464] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 13:58:02,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [372896027] [2024-10-13 13:58:02,135 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-13 13:58:02,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:58:02,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:58:02,137 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 13:58:02,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-13 13:58:02,506 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) [2024-10-13 13:58:02,506 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 13:58:02,518 INFO L255 TraceCheckSpWp]: Trace formula consists of 1547 conjuncts, 192 conjuncts are in the unsatisfiable core [2024-10-13 13:58:02,528 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:58:03,220 INFO L134 CoverageAnalysis]: Checked inductivity of 35438 backedges. 0 proven. 35438 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:58:03,220 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 13:58:26,975 INFO L134 CoverageAnalysis]: Checked inductivity of 35438 backedges. 0 proven. 35438 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:58:26,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [372896027] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 13:58:26,975 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 13:58:26,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [192, 192, 192] total 383 [2024-10-13 13:58:26,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705431675] [2024-10-13 13:58:26,976 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 13:58:26,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 384 states [2024-10-13 13:58:26,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:58:26,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 384 interpolants. [2024-10-13 13:58:26,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36676, Invalid=110396, Unknown=0, NotChecked=0, Total=147072 [2024-10-13 13:58:26,990 INFO L87 Difference]: Start difference. First operand 762 states and 762 transitions. Second operand has 384 states, 383 states have (on average 3.475195822454308) internal successors, (1331), 194 states have internal predecessors, (1331), 190 states have call successors, (190), 190 states have call predecessors, (190), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)