./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/sqrt1-ll_valuebound100.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/sqrt1-ll_valuebound100.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 ecbe5f0ce97488539db604edfadf8e9064f15df8e290f20f11bd6c6bd2401ed2 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 12:10:46,058 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 12:10:46,141 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-09 12:10:46,145 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 12:10:46,146 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 12:10:46,173 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 12:10:46,174 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 12:10:46,174 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 12:10:46,175 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 12:10:46,177 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 12:10:46,177 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 12:10:46,177 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 12:10:46,178 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 12:10:46,178 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 12:10:46,178 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 12:10:46,179 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 12:10:46,179 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 12:10:46,179 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 12:10:46,179 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 12:10:46,180 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 12:10:46,180 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 12:10:46,184 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 12:10:46,184 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 12:10:46,184 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 12:10:46,184 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 12:10:46,185 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-09 12:10:46,185 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 12:10:46,185 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 12:10:46,185 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 12:10:46,186 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 12:10:46,186 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 12:10:46,186 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 12:10:46,187 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 12:10:46,187 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 12:10:46,187 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 12:10:46,187 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 12:10:46,188 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 12:10:46,188 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 12:10:46,188 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 12:10:46,188 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 12:10:46,189 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 12:10:46,189 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 12:10:46,189 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 12:10:46,189 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 12:10:46,190 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 -> ecbe5f0ce97488539db604edfadf8e9064f15df8e290f20f11bd6c6bd2401ed2 [2024-11-09 12:10:46,458 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 12:10:46,481 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 12:10:46,483 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 12:10:46,485 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 12:10:46,485 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 12:10:46,486 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/sqrt1-ll_valuebound100.c [2024-11-09 12:10:47,920 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 12:10:48,117 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 12:10:48,118 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/sqrt1-ll_valuebound100.c [2024-11-09 12:10:48,125 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/340fd0353/18529d00627442e08d332076460c6755/FLAGef0b4decd [2024-11-09 12:10:48,138 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/340fd0353/18529d00627442e08d332076460c6755 [2024-11-09 12:10:48,140 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 12:10:48,141 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 12:10:48,142 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 12:10:48,142 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 12:10:48,147 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 12:10:48,148 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:10:48" (1/1) ... [2024-11-09 12:10:48,149 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e5da6ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:10:48, skipping insertion in model container [2024-11-09 12:10:48,150 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:10:48" (1/1) ... [2024-11-09 12:10:48,170 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 12:10:48,377 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 12:10:48,389 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 12:10:48,406 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 12:10:48,419 INFO L204 MainTranslator]: Completed translation [2024-11-09 12:10:48,419 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:10:48 WrapperNode [2024-11-09 12:10:48,419 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 12:10:48,420 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 12:10:48,420 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 12:10:48,421 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 12:10:48,427 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:10:48" (1/1) ... [2024-11-09 12:10:48,434 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:10:48" (1/1) ... [2024-11-09 12:10:48,456 INFO L138 Inliner]: procedures = 14, calls = 15, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 97 [2024-11-09 12:10:48,456 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 12:10:48,457 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 12:10:48,457 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 12:10:48,457 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 12:10:48,467 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:10:48" (1/1) ... [2024-11-09 12:10:48,468 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:10:48" (1/1) ... [2024-11-09 12:10:48,469 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:10:48" (1/1) ... [2024-11-09 12:10:48,481 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 12:10:48,482 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:10:48" (1/1) ... [2024-11-09 12:10:48,482 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:10:48" (1/1) ... [2024-11-09 12:10:48,485 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:10:48" (1/1) ... [2024-11-09 12:10:48,487 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:10:48" (1/1) ... [2024-11-09 12:10:48,489 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:10:48" (1/1) ... [2024-11-09 12:10:48,490 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:10:48" (1/1) ... [2024-11-09 12:10:48,491 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 12:10:48,492 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 12:10:48,492 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 12:10:48,492 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 12:10:48,493 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:10:48" (1/1) ... [2024-11-09 12:10:48,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 12:10:48,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:10:48,538 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 12:10:48,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 12:10:48,581 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 12:10:48,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 12:10:48,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 12:10:48,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 12:10:48,582 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 12:10:48,582 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 12:10:48,631 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 12:10:48,633 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 12:10:48,939 INFO L? ?]: Removed 67 outVars from TransFormulas that were not future-live. [2024-11-09 12:10:48,939 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 12:10:48,959 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 12:10:48,960 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 12:10:48,961 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:10:48 BoogieIcfgContainer [2024-11-09 12:10:48,962 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 12:10:48,965 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 12:10:48,965 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 12:10:48,969 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 12:10:48,969 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:10:48" (1/3) ... [2024-11-09 12:10:48,970 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@744ad4af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:10:48, skipping insertion in model container [2024-11-09 12:10:48,971 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:10:48" (2/3) ... [2024-11-09 12:10:48,972 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@744ad4af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:10:48, skipping insertion in model container [2024-11-09 12:10:48,972 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:10:48" (3/3) ... [2024-11-09 12:10:48,973 INFO L112 eAbstractionObserver]: Analyzing ICFG sqrt1-ll_valuebound100.c [2024-11-09 12:10:48,991 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 12:10:48,991 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 50 error locations. [2024-11-09 12:10:49,064 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 12:10:49,069 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;@71a3db24, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 12:10:49,070 INFO L334 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2024-11-09 12:10:49,074 INFO L276 IsEmpty]: Start isEmpty. Operand has 122 states, 64 states have (on average 1.859375) internal successors, (119), 114 states have internal predecessors, (119), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 12:10:49,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 12:10:49,078 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:10:49,079 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 12:10:49,079 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2024-11-09 12:10:49,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:10:49,087 INFO L85 PathProgramCache]: Analyzing trace with hash 889508909, now seen corresponding path program 1 times [2024-11-09 12:10:49,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:10:49,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039184939] [2024-11-09 12:10:49,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:10:49,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:10:49,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:49,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 12:10:49,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:10:49,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039184939] [2024-11-09 12:10:49,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039184939] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:10:49,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:10:49,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 12:10:49,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176076762] [2024-11-09 12:10:49,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:10:49,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 12:10:49,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:10:49,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 12:10:49,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 12:10:49,293 INFO L87 Difference]: Start difference. First operand has 122 states, 64 states have (on average 1.859375) internal successors, (119), 114 states have internal predecessors, (119), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 12:10:49,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:10:49,331 INFO L93 Difference]: Finished difference Result 236 states and 263 transitions. [2024-11-09 12:10:49,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 12:10:49,334 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-09 12:10:49,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:10:49,343 INFO L225 Difference]: With dead ends: 236 [2024-11-09 12:10:49,344 INFO L226 Difference]: Without dead ends: 111 [2024-11-09 12:10:49,348 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 12:10:49,351 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 12:10:49,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 12:10:49,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-09 12:10:49,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-11-09 12:10:49,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 59 states have (on average 1.7796610169491525) internal successors, (105), 104 states have internal predecessors, (105), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 12:10:49,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 115 transitions. [2024-11-09 12:10:49,387 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 115 transitions. Word has length 6 [2024-11-09 12:10:49,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:10:49,387 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 115 transitions. [2024-11-09 12:10:49,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 12:10:49,388 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 115 transitions. [2024-11-09 12:10:49,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 12:10:49,388 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:10:49,388 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 12:10:49,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 12:10:49,389 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2024-11-09 12:10:49,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:10:49,389 INFO L85 PathProgramCache]: Analyzing trace with hash 889568486, now seen corresponding path program 1 times [2024-11-09 12:10:49,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:10:49,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217626475] [2024-11-09 12:10:49,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:10:49,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:10:49,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:49,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 12:10:49,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:10:49,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217626475] [2024-11-09 12:10:49,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217626475] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:10:49,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:10:49,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 12:10:49,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418179207] [2024-11-09 12:10:49,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:10:49,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 12:10:49,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:10:49,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 12:10:49,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 12:10:49,485 INFO L87 Difference]: Start difference. First operand 111 states and 115 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 12:10:49,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:10:49,639 INFO L93 Difference]: Finished difference Result 206 states and 215 transitions. [2024-11-09 12:10:49,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 12:10:49,640 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-09 12:10:49,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:10:49,643 INFO L225 Difference]: With dead ends: 206 [2024-11-09 12:10:49,644 INFO L226 Difference]: Without dead ends: 186 [2024-11-09 12:10:49,645 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 12:10:49,646 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 68 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 12:10:49,646 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 164 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 12:10:49,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-09 12:10:49,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 151. [2024-11-09 12:10:49,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 95 states have (on average 1.6105263157894736) internal successors, (153), 140 states have internal predecessors, (153), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 12:10:49,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 171 transitions. [2024-11-09 12:10:49,692 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 171 transitions. Word has length 6 [2024-11-09 12:10:49,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:10:49,693 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 171 transitions. [2024-11-09 12:10:49,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 12:10:49,693 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 171 transitions. [2024-11-09 12:10:49,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 12:10:49,694 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:10:49,694 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:10:49,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 12:10:49,696 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2024-11-09 12:10:49,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:10:49,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1295434416, now seen corresponding path program 1 times [2024-11-09 12:10:49,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:10:49,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117601907] [2024-11-09 12:10:49,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:10:49,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:10:49,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 12:10:49,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1843450649] [2024-11-09 12:10:49,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:10:49,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:10:49,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:10:49,780 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 12:10:49,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 12:10:49,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:49,833 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 12:10:49,837 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:10:49,899 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 12:10:49,899 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 12:10:49,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:10:49,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117601907] [2024-11-09 12:10:49,900 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 12:10:49,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1843450649] [2024-11-09 12:10:49,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1843450649] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:10:49,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:10:49,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 12:10:49,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816865] [2024-11-09 12:10:49,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:10:49,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 12:10:49,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:10:49,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 12:10:49,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 12:10:49,907 INFO L87 Difference]: Start difference. First operand 151 states and 171 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 12:10:50,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:10:50,039 INFO L93 Difference]: Finished difference Result 178 states and 199 transitions. [2024-11-09 12:10:50,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 12:10:50,040 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2024-11-09 12:10:50,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:10:50,045 INFO L225 Difference]: With dead ends: 178 [2024-11-09 12:10:50,045 INFO L226 Difference]: Without dead ends: 170 [2024-11-09 12:10:50,045 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 12:10:50,046 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 41 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 12:10:50,047 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 150 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 12:10:50,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-11-09 12:10:50,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 162. [2024-11-09 12:10:50,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 105 states have (on average 1.561904761904762) internal successors, (164), 150 states have internal predecessors, (164), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-09 12:10:50,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 184 transitions. [2024-11-09 12:10:50,066 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 184 transitions. Word has length 27 [2024-11-09 12:10:50,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:10:50,066 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 184 transitions. [2024-11-09 12:10:50,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 12:10:50,067 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 184 transitions. [2024-11-09 12:10:50,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 12:10:50,071 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:10:50,071 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:10:50,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 12:10:50,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:10:50,273 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2024-11-09 12:10:50,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:10:50,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1503761308, now seen corresponding path program 1 times [2024-11-09 12:10:50,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:10:50,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71285012] [2024-11-09 12:10:50,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:10:50,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:10:50,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:50,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 12:10:50,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:50,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 12:10:50,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:50,416 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 12:10:50,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:10:50,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71285012] [2024-11-09 12:10:50,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71285012] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:10:50,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:10:50,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 12:10:50,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121283072] [2024-11-09 12:10:50,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:10:50,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 12:10:50,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:10:50,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 12:10:50,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 12:10:50,422 INFO L87 Difference]: Start difference. First operand 162 states and 184 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 12:10:50,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:10:50,533 INFO L93 Difference]: Finished difference Result 178 states and 195 transitions. [2024-11-09 12:10:50,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 12:10:50,534 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2024-11-09 12:10:50,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:10:50,535 INFO L225 Difference]: With dead ends: 178 [2024-11-09 12:10:50,535 INFO L226 Difference]: Without dead ends: 168 [2024-11-09 12:10:50,536 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 12:10:50,536 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 38 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 12:10:50,537 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 164 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 12:10:50,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-09 12:10:50,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 165. [2024-11-09 12:10:50,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 108 states have (on average 1.4814814814814814) internal successors, (160), 153 states have internal predecessors, (160), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-09 12:10:50,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 180 transitions. [2024-11-09 12:10:50,552 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 180 transitions. Word has length 28 [2024-11-09 12:10:50,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:10:50,553 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 180 transitions. [2024-11-09 12:10:50,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 12:10:50,553 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 180 transitions. [2024-11-09 12:10:50,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 12:10:50,554 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:10:50,554 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:10:50,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 12:10:50,554 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2024-11-09 12:10:50,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:10:50,555 INFO L85 PathProgramCache]: Analyzing trace with hash 2044306868, now seen corresponding path program 1 times [2024-11-09 12:10:50,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:10:50,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214525298] [2024-11-09 12:10:50,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:10:50,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:10:50,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:50,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 12:10:50,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:50,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 12:10:50,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:50,711 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 12:10:50,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:10:50,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214525298] [2024-11-09 12:10:50,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214525298] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:10:50,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:10:50,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 12:10:50,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146366476] [2024-11-09 12:10:50,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:10:50,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 12:10:50,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:10:50,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 12:10:50,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 12:10:50,713 INFO L87 Difference]: Start difference. First operand 165 states and 180 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 12:10:50,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:10:50,829 INFO L93 Difference]: Finished difference Result 170 states and 185 transitions. [2024-11-09 12:10:50,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 12:10:50,829 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2024-11-09 12:10:50,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:10:50,830 INFO L225 Difference]: With dead ends: 170 [2024-11-09 12:10:50,830 INFO L226 Difference]: Without dead ends: 168 [2024-11-09 12:10:50,831 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 12:10:50,832 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 80 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 12:10:50,832 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 156 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 12:10:50,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-09 12:10:50,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 165. [2024-11-09 12:10:50,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 108 states have (on average 1.462962962962963) internal successors, (158), 153 states have internal predecessors, (158), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-09 12:10:50,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 178 transitions. [2024-11-09 12:10:50,854 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 178 transitions. Word has length 31 [2024-11-09 12:10:50,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:10:50,854 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 178 transitions. [2024-11-09 12:10:50,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 12:10:50,855 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 178 transitions. [2024-11-09 12:10:50,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 12:10:50,855 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:10:50,856 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:10:50,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 12:10:50,856 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2024-11-09 12:10:50,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:10:50,857 INFO L85 PathProgramCache]: Analyzing trace with hash 76490936, now seen corresponding path program 1 times [2024-11-09 12:10:50,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:10:50,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899796793] [2024-11-09 12:10:50,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:10:50,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:10:50,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:50,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 12:10:51,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:51,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 12:10:51,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:51,022 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 12:10:51,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:10:51,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899796793] [2024-11-09 12:10:51,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899796793] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:10:51,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:10:51,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 12:10:51,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258661615] [2024-11-09 12:10:51,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:10:51,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 12:10:51,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:10:51,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 12:10:51,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 12:10:51,028 INFO L87 Difference]: Start difference. First operand 165 states and 178 transitions. Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 12:10:51,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:10:51,150 INFO L93 Difference]: Finished difference Result 170 states and 179 transitions. [2024-11-09 12:10:51,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 12:10:51,151 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2024-11-09 12:10:51,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:10:51,152 INFO L225 Difference]: With dead ends: 170 [2024-11-09 12:10:51,152 INFO L226 Difference]: Without dead ends: 142 [2024-11-09 12:10:51,152 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 12:10:51,153 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 29 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 12:10:51,153 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 146 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 12:10:51,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-09 12:10:51,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2024-11-09 12:10:51,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 87 states have (on average 1.528735632183908) internal successors, (133), 132 states have internal predecessors, (133), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 12:10:51,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 149 transitions. [2024-11-09 12:10:51,168 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 149 transitions. Word has length 35 [2024-11-09 12:10:51,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:10:51,169 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 149 transitions. [2024-11-09 12:10:51,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 12:10:51,169 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 149 transitions. [2024-11-09 12:10:51,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-09 12:10:51,170 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:10:51,170 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:10:51,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 12:10:51,171 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2024-11-09 12:10:51,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:10:51,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1341873330, now seen corresponding path program 1 times [2024-11-09 12:10:51,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:10:51,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699085483] [2024-11-09 12:10:51,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:10:51,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:10:51,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:51,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 12:10:51,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:51,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 12:10:51,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:51,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 12:10:51,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:51,379 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 12:10:51,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:10:51,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699085483] [2024-11-09 12:10:51,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699085483] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:10:51,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:10:51,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 12:10:51,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164323578] [2024-11-09 12:10:51,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:10:51,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 12:10:51,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:10:51,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 12:10:51,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 12:10:51,384 INFO L87 Difference]: Start difference. First operand 142 states and 149 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 12:10:51,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:10:51,519 INFO L93 Difference]: Finished difference Result 145 states and 153 transitions. [2024-11-09 12:10:51,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 12:10:51,520 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 48 [2024-11-09 12:10:51,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:10:51,524 INFO L225 Difference]: With dead ends: 145 [2024-11-09 12:10:51,524 INFO L226 Difference]: Without dead ends: 144 [2024-11-09 12:10:51,524 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 12:10:51,525 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 1 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 12:10:51,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 210 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 12:10:51,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-09 12:10:51,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 143. [2024-11-09 12:10:51,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 88 states have (on average 1.5227272727272727) internal successors, (134), 133 states have internal predecessors, (134), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 12:10:51,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 150 transitions. [2024-11-09 12:10:51,540 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 150 transitions. Word has length 48 [2024-11-09 12:10:51,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:10:51,540 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 150 transitions. [2024-11-09 12:10:51,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 12:10:51,541 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 150 transitions. [2024-11-09 12:10:51,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-09 12:10:51,544 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:10:51,544 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:10:51,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 12:10:51,545 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2024-11-09 12:10:51,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:10:51,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1351599618, now seen corresponding path program 1 times [2024-11-09 12:10:51,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:10:51,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259030081] [2024-11-09 12:10:51,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:10:51,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:10:51,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:51,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 12:10:51,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:51,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 12:10:51,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:51,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 12:10:51,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:51,679 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 12:10:51,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:10:51,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259030081] [2024-11-09 12:10:51,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259030081] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:10:51,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:10:51,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 12:10:51,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576190501] [2024-11-09 12:10:51,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:10:51,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 12:10:51,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:10:51,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 12:10:51,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 12:10:51,682 INFO L87 Difference]: Start difference. First operand 143 states and 150 transitions. Second operand has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 12:10:51,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:10:51,815 INFO L93 Difference]: Finished difference Result 145 states and 152 transitions. [2024-11-09 12:10:51,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 12:10:51,816 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 49 [2024-11-09 12:10:51,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:10:51,819 INFO L225 Difference]: With dead ends: 145 [2024-11-09 12:10:51,819 INFO L226 Difference]: Without dead ends: 144 [2024-11-09 12:10:51,819 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 12:10:51,820 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 0 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 12:10:51,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 214 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 12:10:51,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-09 12:10:51,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2024-11-09 12:10:51,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 89 states have (on average 1.5168539325842696) internal successors, (135), 134 states have internal predecessors, (135), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 12:10:51,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 151 transitions. [2024-11-09 12:10:51,834 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 151 transitions. Word has length 49 [2024-11-09 12:10:51,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:10:51,835 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 151 transitions. [2024-11-09 12:10:51,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 12:10:51,835 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 151 transitions. [2024-11-09 12:10:51,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-09 12:10:51,839 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:10:51,839 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:10:51,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 12:10:51,839 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2024-11-09 12:10:51,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:10:51,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1807107968, now seen corresponding path program 1 times [2024-11-09 12:10:51,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:10:51,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900371443] [2024-11-09 12:10:51,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:10:51,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:10:51,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:51,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 12:10:51,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:51,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 12:10:51,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:51,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 12:10:51,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:51,935 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 12:10:51,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:10:51,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900371443] [2024-11-09 12:10:51,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900371443] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 12:10:51,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1847783462] [2024-11-09 12:10:51,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:10:51,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:10:51,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:10:51,938 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 12:10:51,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 12:10:51,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:51,988 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 12:10:51,990 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:10:52,085 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 12:10:52,085 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 12:10:52,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1847783462] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:10:52,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 12:10:52,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2024-11-09 12:10:52,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181679619] [2024-11-09 12:10:52,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:10:52,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 12:10:52,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:10:52,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 12:10:52,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 12:10:52,087 INFO L87 Difference]: Start difference. First operand 144 states and 151 transitions. Second operand has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 12:10:52,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:10:52,175 INFO L93 Difference]: Finished difference Result 144 states and 151 transitions. [2024-11-09 12:10:52,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 12:10:52,176 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 51 [2024-11-09 12:10:52,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:10:52,178 INFO L225 Difference]: With dead ends: 144 [2024-11-09 12:10:52,179 INFO L226 Difference]: Without dead ends: 135 [2024-11-09 12:10:52,179 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 12:10:52,180 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 120 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 12:10:52,180 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 120 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 12:10:52,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-09 12:10:52,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2024-11-09 12:10:52,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 89 states have (on average 1.4157303370786516) internal successors, (126), 125 states have internal predecessors, (126), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 12:10:52,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 142 transitions. [2024-11-09 12:10:52,193 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 142 transitions. Word has length 51 [2024-11-09 12:10:52,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:10:52,194 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 142 transitions. [2024-11-09 12:10:52,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 12:10:52,194 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 142 transitions. [2024-11-09 12:10:52,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-09 12:10:52,195 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:10:52,195 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:10:52,214 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 12:10:52,396 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,SelfDestructingSolverStorable8 [2024-11-09 12:10:52,396 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2024-11-09 12:10:52,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:10:52,397 INFO L85 PathProgramCache]: Analyzing trace with hash -185772108, now seen corresponding path program 1 times [2024-11-09 12:10:52,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:10:52,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141688600] [2024-11-09 12:10:52,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:10:52,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:10:52,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:52,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 12:10:52,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:52,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 12:10:52,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:52,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 12:10:52,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:52,491 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 12:10:52,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:10:52,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141688600] [2024-11-09 12:10:52,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141688600] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 12:10:52,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968546309] [2024-11-09 12:10:52,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:10:52,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:10:52,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:10:52,496 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 12:10:52,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 12:10:52,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:52,584 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 12:10:52,588 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:10:52,644 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 12:10:52,644 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 12:10:52,732 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 12:10:52,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [968546309] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 12:10:52,732 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 12:10:52,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-11-09 12:10:52,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097270221] [2024-11-09 12:10:52,733 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 12:10:52,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 12:10:52,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:10:52,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 12:10:52,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-09 12:10:52,734 INFO L87 Difference]: Start difference. First operand 135 states and 142 transitions. Second operand has 7 states, 6 states have (on average 16.833333333333332) internal successors, (101), 7 states have internal predecessors, (101), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-09 12:10:52,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:10:52,887 INFO L93 Difference]: Finished difference Result 230 states and 259 transitions. [2024-11-09 12:10:52,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 12:10:52,887 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 16.833333333333332) internal successors, (101), 7 states have internal predecessors, (101), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 52 [2024-11-09 12:10:52,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:10:52,889 INFO L225 Difference]: With dead ends: 230 [2024-11-09 12:10:52,890 INFO L226 Difference]: Without dead ends: 221 [2024-11-09 12:10:52,891 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-09 12:10:52,891 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 175 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 12:10:52,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 262 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 12:10:52,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2024-11-09 12:10:52,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 126. [2024-11-09 12:10:52,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 89 states have (on average 1.3146067415730338) internal successors, (117), 116 states have internal predecessors, (117), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 12:10:52,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 133 transitions. [2024-11-09 12:10:52,906 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 133 transitions. Word has length 52 [2024-11-09 12:10:52,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:10:52,907 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 133 transitions. [2024-11-09 12:10:52,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 16.833333333333332) internal successors, (101), 7 states have internal predecessors, (101), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-09 12:10:52,907 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 133 transitions. [2024-11-09 12:10:52,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-09 12:10:52,909 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:10:52,911 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:10:52,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-09 12:10:53,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:10:53,112 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2024-11-09 12:10:53,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:10:53,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1650363250, now seen corresponding path program 1 times [2024-11-09 12:10:53,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:10:53,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826383796] [2024-11-09 12:10:53,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:10:53,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:10:53,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 12:10:53,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1010351830] [2024-11-09 12:10:53,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:10:53,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:10:53,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:10:53,132 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 12:10:53,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 12:10:53,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:53,185 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 12:10:53,187 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:10:53,255 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 12:10:53,255 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 12:10:53,388 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 12:10:53,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:10:53,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826383796] [2024-11-09 12:10:53,389 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 12:10:53,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1010351830] [2024-11-09 12:10:53,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1010351830] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 12:10:53,389 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 12:10:53,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2024-11-09 12:10:53,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375374822] [2024-11-09 12:10:53,389 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 12:10:53,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 12:10:53,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:10:53,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 12:10:53,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 12:10:53,391 INFO L87 Difference]: Start difference. First operand 126 states and 133 transitions. Second operand has 6 states, 5 states have (on average 18.0) internal successors, (90), 6 states have internal predecessors, (90), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-09 12:10:53,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:10:53,573 INFO L93 Difference]: Finished difference Result 305 states and 327 transitions. [2024-11-09 12:10:53,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 12:10:53,574 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 18.0) internal successors, (90), 6 states have internal predecessors, (90), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 65 [2024-11-09 12:10:53,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:10:53,576 INFO L225 Difference]: With dead ends: 305 [2024-11-09 12:10:53,576 INFO L226 Difference]: Without dead ends: 303 [2024-11-09 12:10:53,576 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-11-09 12:10:53,577 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 340 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 12:10:53,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 311 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 12:10:53,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2024-11-09 12:10:53,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 203. [2024-11-09 12:10:53,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 160 states have (on average 1.36875) internal successors, (219), 186 states have internal predecessors, (219), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 12:10:53,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 249 transitions. [2024-11-09 12:10:53,589 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 249 transitions. Word has length 65 [2024-11-09 12:10:53,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:10:53,590 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 249 transitions. [2024-11-09 12:10:53,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 18.0) internal successors, (90), 6 states have internal predecessors, (90), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-09 12:10:53,590 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 249 transitions. [2024-11-09 12:10:53,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-09 12:10:53,591 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:10:53,591 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:10:53,609 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 12:10:53,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:10:53,796 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2024-11-09 12:10:53,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:10:53,796 INFO L85 PathProgramCache]: Analyzing trace with hash 809495382, now seen corresponding path program 1 times [2024-11-09 12:10:53,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:10:53,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007086501] [2024-11-09 12:10:53,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:10:53,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:10:53,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 12:10:53,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [254754706] [2024-11-09 12:10:53,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:10:53,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:10:53,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:10:53,819 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 12:10:53,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 12:10:53,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:53,875 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 12:10:53,877 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:10:53,953 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 12:10:53,953 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 12:10:54,078 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 12:10:54,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:10:54,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007086501] [2024-11-09 12:10:54,079 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 12:10:54,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [254754706] [2024-11-09 12:10:54,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [254754706] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 12:10:54,079 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 12:10:54,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2024-11-09 12:10:54,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832106095] [2024-11-09 12:10:54,080 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 12:10:54,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 12:10:54,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:10:54,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 12:10:54,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 12:10:54,081 INFO L87 Difference]: Start difference. First operand 203 states and 249 transitions. Second operand has 6 states, 5 states have (on average 18.8) internal successors, (94), 6 states have internal predecessors, (94), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2024-11-09 12:10:54,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:10:54,334 INFO L93 Difference]: Finished difference Result 263 states and 326 transitions. [2024-11-09 12:10:54,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 12:10:54,335 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 18.8) internal successors, (94), 6 states have internal predecessors, (94), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 72 [2024-11-09 12:10:54,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:10:54,336 INFO L225 Difference]: With dead ends: 263 [2024-11-09 12:10:54,336 INFO L226 Difference]: Without dead ends: 255 [2024-11-09 12:10:54,337 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-11-09 12:10:54,337 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 177 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 12:10:54,338 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 228 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 12:10:54,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2024-11-09 12:10:54,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 199. [2024-11-09 12:10:54,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 162 states have (on average 1.2592592592592593) internal successors, (204), 181 states have internal predecessors, (204), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 12:10:54,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 236 transitions. [2024-11-09 12:10:54,354 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 236 transitions. Word has length 72 [2024-11-09 12:10:54,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:10:54,354 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 236 transitions. [2024-11-09 12:10:54,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 18.8) internal successors, (94), 6 states have internal predecessors, (94), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2024-11-09 12:10:54,355 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 236 transitions. [2024-11-09 12:10:54,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-09 12:10:54,358 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:10:54,358 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:10:54,376 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-11-09 12:10:54,562 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,SelfDestructingSolverStorable11 [2024-11-09 12:10:54,563 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2024-11-09 12:10:54,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:10:54,563 INFO L85 PathProgramCache]: Analyzing trace with hash -675446858, now seen corresponding path program 1 times [2024-11-09 12:10:54,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:10:54,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359444612] [2024-11-09 12:10:54,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:10:54,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:10:54,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:54,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 12:10:54,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:54,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 12:10:54,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:54,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 12:10:54,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:54,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 12:10:54,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:54,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 12:10:54,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:54,671 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 12:10:54,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:10:54,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359444612] [2024-11-09 12:10:54,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359444612] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 12:10:54,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997192038] [2024-11-09 12:10:54,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:10:54,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:10:54,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:10:54,674 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 12:10:54,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 12:10:54,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:54,721 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 12:10:54,723 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:10:54,894 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 12:10:54,894 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 12:10:55,006 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 12:10:55,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1997192038] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 12:10:55,007 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 12:10:55,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2024-11-09 12:10:55,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438003499] [2024-11-09 12:10:55,008 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 12:10:55,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 12:10:55,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:10:55,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 12:10:55,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2024-11-09 12:10:55,009 INFO L87 Difference]: Start difference. First operand 199 states and 236 transitions. Second operand has 10 states, 9 states have (on average 14.11111111111111) internal successors, (127), 10 states have internal predecessors, (127), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2024-11-09 12:10:55,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:10:55,220 INFO L93 Difference]: Finished difference Result 199 states and 236 transitions. [2024-11-09 12:10:55,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 12:10:55,221 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 14.11111111111111) internal successors, (127), 10 states have internal predecessors, (127), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 73 [2024-11-09 12:10:55,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:10:55,222 INFO L225 Difference]: With dead ends: 199 [2024-11-09 12:10:55,222 INFO L226 Difference]: Without dead ends: 196 [2024-11-09 12:10:55,223 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2024-11-09 12:10:55,223 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 90 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 12:10:55,223 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 212 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 12:10:55,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-11-09 12:10:55,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2024-11-09 12:10:55,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 162 states have (on average 1.2160493827160495) internal successors, (197), 178 states have internal predecessors, (197), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 12:10:55,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 229 transitions. [2024-11-09 12:10:55,235 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 229 transitions. Word has length 73 [2024-11-09 12:10:55,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:10:55,235 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 229 transitions. [2024-11-09 12:10:55,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 14.11111111111111) internal successors, (127), 10 states have internal predecessors, (127), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2024-11-09 12:10:55,235 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 229 transitions. [2024-11-09 12:10:55,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-09 12:10:55,236 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:10:55,236 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:10:55,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-09 12:10:55,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:10:55,437 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2024-11-09 12:10:55,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:10:55,438 INFO L85 PathProgramCache]: Analyzing trace with hash 535983960, now seen corresponding path program 1 times [2024-11-09 12:10:55,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:10:55,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161965583] [2024-11-09 12:10:55,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:10:55,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:10:55,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:55,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 12:10:55,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:55,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 12:10:55,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:55,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 12:10:55,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:55,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 12:10:55,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:55,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 12:10:55,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:55,568 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 12:10:55,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:10:55,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161965583] [2024-11-09 12:10:55,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161965583] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 12:10:55,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [507655279] [2024-11-09 12:10:55,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:10:55,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:10:55,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:10:55,570 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 12:10:55,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 12:10:55,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:55,620 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 12:10:55,623 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:10:55,766 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 12:10:55,767 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 12:10:55,875 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 12:10:55,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [507655279] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 12:10:55,875 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 12:10:55,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2024-11-09 12:10:55,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874930188] [2024-11-09 12:10:55,876 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 12:10:55,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 12:10:55,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:10:55,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 12:10:55,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=50, Unknown=0, NotChecked=0, Total=90 [2024-11-09 12:10:55,877 INFO L87 Difference]: Start difference. First operand 196 states and 229 transitions. Second operand has 10 states, 9 states have (on average 14.333333333333334) internal successors, (129), 10 states have internal predecessors, (129), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2024-11-09 12:10:56,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:10:56,103 INFO L93 Difference]: Finished difference Result 222 states and 261 transitions. [2024-11-09 12:10:56,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 12:10:56,104 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 14.333333333333334) internal successors, (129), 10 states have internal predecessors, (129), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 74 [2024-11-09 12:10:56,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:10:56,105 INFO L225 Difference]: With dead ends: 222 [2024-11-09 12:10:56,106 INFO L226 Difference]: Without dead ends: 213 [2024-11-09 12:10:56,106 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=72, Unknown=0, NotChecked=0, Total=132 [2024-11-09 12:10:56,106 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 155 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 12:10:56,107 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 206 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 12:10:56,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-11-09 12:10:56,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 189. [2024-11-09 12:10:56,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 162 states have (on average 1.117283950617284) internal successors, (181), 171 states have internal predecessors, (181), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 12:10:56,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 213 transitions. [2024-11-09 12:10:56,119 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 213 transitions. Word has length 74 [2024-11-09 12:10:56,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:10:56,120 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 213 transitions. [2024-11-09 12:10:56,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 14.333333333333334) internal successors, (129), 10 states have internal predecessors, (129), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2024-11-09 12:10:56,120 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 213 transitions. [2024-11-09 12:10:56,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-09 12:10:56,120 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:10:56,121 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:10:56,137 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-09 12:10:56,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:10:56,322 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2024-11-09 12:10:56,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:10:56,322 INFO L85 PathProgramCache]: Analyzing trace with hash -315487398, now seen corresponding path program 1 times [2024-11-09 12:10:56,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:10:56,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714783298] [2024-11-09 12:10:56,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:10:56,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:10:56,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:56,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 12:10:56,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:56,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 12:10:56,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:56,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 12:10:56,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:56,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 12:10:56,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:56,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 12:10:56,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:56,457 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 12:10:56,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:10:56,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714783298] [2024-11-09 12:10:56,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714783298] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 12:10:56,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [661956966] [2024-11-09 12:10:56,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:10:56,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:10:56,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:10:56,459 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 12:10:56,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 12:10:56,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:56,506 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 12:10:56,508 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:10:56,719 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 12:10:56,719 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 12:10:56,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [661956966] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:10:56,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 12:10:56,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2024-11-09 12:10:56,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211075603] [2024-11-09 12:10:56,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:10:56,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 12:10:56,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:10:56,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 12:10:56,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-09 12:10:56,721 INFO L87 Difference]: Start difference. First operand 189 states and 213 transitions. Second operand has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-09 12:10:56,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:10:56,829 INFO L93 Difference]: Finished difference Result 189 states and 213 transitions. [2024-11-09 12:10:56,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 12:10:56,830 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 76 [2024-11-09 12:10:56,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:10:56,831 INFO L225 Difference]: With dead ends: 189 [2024-11-09 12:10:56,831 INFO L226 Difference]: Without dead ends: 159 [2024-11-09 12:10:56,831 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-09 12:10:56,832 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 35 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 12:10:56,832 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 137 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 12:10:56,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-09 12:10:56,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2024-11-09 12:10:56,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 140 states have (on average 1.0357142857142858) internal successors, (145), 143 states have internal predecessors, (145), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 12:10:56,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 173 transitions. [2024-11-09 12:10:56,841 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 173 transitions. Word has length 76 [2024-11-09 12:10:56,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:10:56,842 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 173 transitions. [2024-11-09 12:10:56,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-09 12:10:56,842 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 173 transitions. [2024-11-09 12:10:56,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-09 12:10:56,843 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:10:56,843 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1] [2024-11-09 12:10:56,860 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-09 12:10:57,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-09 12:10:57,045 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2024-11-09 12:10:57,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:10:57,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1290551230, now seen corresponding path program 1 times [2024-11-09 12:10:57,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:10:57,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348363599] [2024-11-09 12:10:57,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:10:57,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:10:57,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:57,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 12:10:57,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:57,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 12:10:57,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:57,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 12:10:57,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:57,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 12:10:57,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:57,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 12:10:57,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:57,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 12:10:57,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:57,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-09 12:10:57,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:57,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 12:10:57,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:57,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-09 12:10:57,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:57,252 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-09 12:10:57,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:10:57,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348363599] [2024-11-09 12:10:57,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348363599] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 12:10:57,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839858685] [2024-11-09 12:10:57,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:10:57,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:10:57,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:10:57,254 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 12:10:57,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 12:10:57,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:57,316 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 12:10:57,319 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:10:57,666 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-09 12:10:57,666 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 12:10:57,909 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-09 12:10:57,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [839858685] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 12:10:57,911 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 12:10:57,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2024-11-09 12:10:57,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973220716] [2024-11-09 12:10:57,911 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 12:10:57,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-09 12:10:57,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:10:57,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-09 12:10:57,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=236, Unknown=0, NotChecked=0, Total=380 [2024-11-09 12:10:57,915 INFO L87 Difference]: Start difference. First operand 159 states and 173 transitions. Second operand has 20 states, 19 states have (on average 14.68421052631579) internal successors, (279), 20 states have internal predecessors, (279), 9 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 9 states have call predecessors, (27), 9 states have call successors, (27) [2024-11-09 12:10:58,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:10:58,262 INFO L93 Difference]: Finished difference Result 246 states and 274 transitions. [2024-11-09 12:10:58,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 12:10:58,263 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 14.68421052631579) internal successors, (279), 20 states have internal predecessors, (279), 9 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 9 states have call predecessors, (27), 9 states have call successors, (27) Word has length 139 [2024-11-09 12:10:58,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:10:58,266 INFO L225 Difference]: With dead ends: 246 [2024-11-09 12:10:58,266 INFO L226 Difference]: Without dead ends: 245 [2024-11-09 12:10:58,267 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=248, Invalid=402, Unknown=0, NotChecked=0, Total=650 [2024-11-09 12:10:58,268 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 7 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 12:10:58,269 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 254 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 12:10:58,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2024-11-09 12:10:58,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 243. [2024-11-09 12:10:58,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 217 states have (on average 1.0506912442396312) internal successors, (228), 220 states have internal predecessors, (228), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-09 12:10:58,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 270 transitions. [2024-11-09 12:10:58,284 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 270 transitions. Word has length 139 [2024-11-09 12:10:58,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:10:58,285 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 270 transitions. [2024-11-09 12:10:58,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 14.68421052631579) internal successors, (279), 20 states have internal predecessors, (279), 9 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 9 states have call predecessors, (27), 9 states have call successors, (27) [2024-11-09 12:10:58,285 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 270 transitions. [2024-11-09 12:10:58,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-09 12:10:58,287 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:10:58,287 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2024-11-09 12:10:58,306 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-09 12:10:58,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-09 12:10:58,488 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2024-11-09 12:10:58,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:10:58,488 INFO L85 PathProgramCache]: Analyzing trace with hash 127166872, now seen corresponding path program 2 times [2024-11-09 12:10:58,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:10:58,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310271711] [2024-11-09 12:10:58,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:10:58,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:10:58,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:58,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 12:10:58,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:58,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 12:10:58,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:58,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 12:10:58,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:58,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 12:10:58,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:58,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 12:10:58,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:58,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 12:10:58,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:58,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-09 12:10:58,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:58,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 12:10:58,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:58,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-09 12:10:58,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:58,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-09 12:10:58,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:58,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-09 12:10:58,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:58,735 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 0 proven. 150 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 12:10:58,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:10:58,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310271711] [2024-11-09 12:10:58,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310271711] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 12:10:58,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803247773] [2024-11-09 12:10:58,736 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 12:10:58,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:10:58,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:10:58,738 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 12:10:58,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-09 12:10:58,807 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 12:10:58,807 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 12:10:58,809 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 12:10:58,811 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:10:59,188 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 0 proven. 150 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 12:10:59,188 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 12:10:59,478 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 0 proven. 150 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 12:10:59,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [803247773] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 12:10:59,478 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 12:10:59,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2024-11-09 12:10:59,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587018260] [2024-11-09 12:10:59,479 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 12:10:59,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-09 12:10:59,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:10:59,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-09 12:10:59,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=297, Unknown=0, NotChecked=0, Total=462 [2024-11-09 12:10:59,481 INFO L87 Difference]: Start difference. First operand 243 states and 270 transitions. Second operand has 22 states, 21 states have (on average 14.714285714285714) internal successors, (309), 22 states have internal predecessors, (309), 11 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 11 states have call predecessors, (31), 11 states have call successors, (31) [2024-11-09 12:10:59,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:10:59,917 INFO L93 Difference]: Finished difference Result 265 states and 292 transitions. [2024-11-09 12:10:59,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 12:10:59,918 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 14.714285714285714) internal successors, (309), 22 states have internal predecessors, (309), 11 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 11 states have call predecessors, (31), 11 states have call successors, (31) Word has length 164 [2024-11-09 12:10:59,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:10:59,919 INFO L225 Difference]: With dead ends: 265 [2024-11-09 12:10:59,920 INFO L226 Difference]: Without dead ends: 264 [2024-11-09 12:10:59,920 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 336 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=319, Invalid=551, Unknown=0, NotChecked=0, Total=870 [2024-11-09 12:10:59,921 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 88 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 12:10:59,921 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 272 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 12:10:59,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-11-09 12:10:59,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 260. [2024-11-09 12:10:59,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 232 states have (on average 1.043103448275862) internal successors, (242), 235 states have internal predecessors, (242), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-09 12:10:59,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 288 transitions. [2024-11-09 12:10:59,935 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 288 transitions. Word has length 164 [2024-11-09 12:10:59,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:10:59,935 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 288 transitions. [2024-11-09 12:10:59,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 14.714285714285714) internal successors, (309), 22 states have internal predecessors, (309), 11 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 11 states have call predecessors, (31), 11 states have call successors, (31) [2024-11-09 12:10:59,936 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 288 transitions. [2024-11-09 12:10:59,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-09 12:10:59,937 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:10:59,938 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2024-11-09 12:10:59,956 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-09 12:11:00,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-09 12:11:00,138 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2024-11-09 12:11:00,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:11:00,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1781711604, now seen corresponding path program 2 times [2024-11-09 12:11:00,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:11:00,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910912338] [2024-11-09 12:11:00,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:11:00,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:11:00,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 12:11:00,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [682227849] [2024-11-09 12:11:00,169 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 12:11:00,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:11:00,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:11:00,170 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 12:11:00,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-09 12:11:00,254 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 12:11:00,254 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 12:11:00,256 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 12:11:00,259 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:11:00,457 INFO L134 CoverageAnalysis]: Checked inductivity of 558 backedges. 0 proven. 246 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-09 12:11:00,458 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 12:11:00,823 INFO L134 CoverageAnalysis]: Checked inductivity of 558 backedges. 0 proven. 246 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-09 12:11:00,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:11:00,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910912338] [2024-11-09 12:11:00,823 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 12:11:00,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [682227849] [2024-11-09 12:11:00,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [682227849] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 12:11:00,823 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 12:11:00,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2024-11-09 12:11:00,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299441934] [2024-11-09 12:11:00,824 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 12:11:00,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 12:11:00,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:11:00,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 12:11:00,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-11-09 12:11:00,825 INFO L87 Difference]: Start difference. First operand 260 states and 288 transitions. Second operand has 12 states, 11 states have (on average 24.545454545454547) internal successors, (270), 12 states have internal predecessors, (270), 10 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) [2024-11-09 12:11:01,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:11:01,270 INFO L93 Difference]: Finished difference Result 365 states and 400 transitions. [2024-11-09 12:11:01,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 12:11:01,271 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 24.545454545454547) internal successors, (270), 12 states have internal predecessors, (270), 10 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) Word has length 200 [2024-11-09 12:11:01,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:11:01,274 INFO L225 Difference]: With dead ends: 365 [2024-11-09 12:11:01,274 INFO L226 Difference]: Without dead ends: 364 [2024-11-09 12:11:01,274 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 388 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2024-11-09 12:11:01,275 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 122 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 12:11:01,276 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 711 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 12:11:01,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2024-11-09 12:11:01,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 354. [2024-11-09 12:11:01,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 318 states have (on average 1.0440251572327044) internal successors, (332), 321 states have internal predecessors, (332), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-09 12:11:01,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 394 transitions. [2024-11-09 12:11:01,297 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 394 transitions. Word has length 200 [2024-11-09 12:11:01,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:11:01,297 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 394 transitions. [2024-11-09 12:11:01,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 24.545454545454547) internal successors, (270), 12 states have internal predecessors, (270), 10 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) [2024-11-09 12:11:01,298 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 394 transitions. [2024-11-09 12:11:01,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-09 12:11:01,300 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:11:01,300 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2024-11-09 12:11:01,317 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-09 12:11:01,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-09 12:11:01,501 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2024-11-09 12:11:01,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:11:01,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1307754032, now seen corresponding path program 2 times [2024-11-09 12:11:01,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:11:01,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835338885] [2024-11-09 12:11:01,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:11:01,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:11:01,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 12:11:01,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1194872305] [2024-11-09 12:11:01,535 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 12:11:01,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:11:01,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:11:01,538 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 12:11:01,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-09 12:11:01,707 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 12:11:01,708 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 12:11:01,709 INFO L255 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-09 12:11:01,711 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:11:02,152 INFO L134 CoverageAnalysis]: Checked inductivity of 622 backedges. 0 proven. 258 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 12:11:02,152 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 12:11:02,545 INFO L134 CoverageAnalysis]: Checked inductivity of 622 backedges. 0 proven. 258 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 12:11:02,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:11:02,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835338885] [2024-11-09 12:11:02,545 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 12:11:02,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1194872305] [2024-11-09 12:11:02,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1194872305] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 12:11:02,545 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 12:11:02,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6] total 15 [2024-11-09 12:11:02,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128018924] [2024-11-09 12:11:02,545 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 12:11:02,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 12:11:02,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:11:02,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 12:11:02,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2024-11-09 12:11:02,548 INFO L87 Difference]: Start difference. First operand 354 states and 394 transitions. Second operand has 16 states, 15 states have (on average 18.266666666666666) internal successors, (274), 16 states have internal predecessors, (274), 10 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 10 states have call predecessors, (28), 10 states have call successors, (28) [2024-11-09 12:11:03,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:11:03,320 INFO L93 Difference]: Finished difference Result 360 states and 399 transitions. [2024-11-09 12:11:03,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 12:11:03,321 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 18.266666666666666) internal successors, (274), 16 states have internal predecessors, (274), 10 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 10 states have call predecessors, (28), 10 states have call successors, (28) Word has length 207 [2024-11-09 12:11:03,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:11:03,323 INFO L225 Difference]: With dead ends: 360 [2024-11-09 12:11:03,323 INFO L226 Difference]: Without dead ends: 359 [2024-11-09 12:11:03,324 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 398 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=241, Unknown=0, NotChecked=0, Total=380 [2024-11-09 12:11:03,324 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 113 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 1318 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 1325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 12:11:03,324 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 429 Invalid, 1325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1318 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 12:11:03,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2024-11-09 12:11:03,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 357. [2024-11-09 12:11:03,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 320 states have (on average 1.028125) internal successors, (329), 323 states have internal predecessors, (329), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-09 12:11:03,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 393 transitions. [2024-11-09 12:11:03,347 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 393 transitions. Word has length 207 [2024-11-09 12:11:03,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:11:03,348 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 393 transitions. [2024-11-09 12:11:03,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 18.266666666666666) internal successors, (274), 16 states have internal predecessors, (274), 10 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 10 states have call predecessors, (28), 10 states have call successors, (28) [2024-11-09 12:11:03,348 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 393 transitions. [2024-11-09 12:11:03,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2024-11-09 12:11:03,353 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:11:03,353 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1] [2024-11-09 12:11:03,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-09 12:11:03,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:11:03,554 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2024-11-09 12:11:03,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:11:03,555 INFO L85 PathProgramCache]: Analyzing trace with hash -455656642, now seen corresponding path program 2 times [2024-11-09 12:11:03,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:11:03,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48911279] [2024-11-09 12:11:03,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:11:03,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:11:03,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:04,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 12:11:04,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:04,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 12:11:04,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:04,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 12:11:04,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:04,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 12:11:04,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:04,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 12:11:04,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:04,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 12:11:04,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:04,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-09 12:11:04,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:04,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 12:11:04,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:04,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-09 12:11:04,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:04,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-09 12:11:04,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:04,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-09 12:11:04,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:04,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-09 12:11:04,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:04,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-11-09 12:11:04,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:04,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-11-09 12:11:04,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:04,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2024-11-09 12:11:04,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:04,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2024-11-09 12:11:04,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:04,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2024-11-09 12:11:04,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:04,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2024-11-09 12:11:04,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:04,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 279 [2024-11-09 12:11:04,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:04,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 290 [2024-11-09 12:11:04,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:04,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 307 [2024-11-09 12:11:04,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:04,259 INFO L134 CoverageAnalysis]: Checked inductivity of 1533 backedges. 0 proven. 693 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-09 12:11:04,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:11:04,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48911279] [2024-11-09 12:11:04,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48911279] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 12:11:04,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1583792411] [2024-11-09 12:11:04,260 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 12:11:04,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:11:04,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:11:04,262 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 12:11:04,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-09 12:11:04,356 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 12:11:04,356 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 12:11:04,359 INFO L255 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 12:11:04,364 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:11:04,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1533 backedges. 36 proven. 36 refuted. 0 times theorem prover too weak. 1461 trivial. 0 not checked. [2024-11-09 12:11:04,713 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 12:11:05,112 INFO L134 CoverageAnalysis]: Checked inductivity of 1533 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 1461 trivial. 0 not checked. [2024-11-09 12:11:05,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1583792411] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 12:11:05,112 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 12:11:05,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 5, 5] total 23 [2024-11-09 12:11:05,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905933962] [2024-11-09 12:11:05,113 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 12:11:05,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-09 12:11:05,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:11:05,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-09 12:11:05,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=478, Unknown=0, NotChecked=0, Total=552 [2024-11-09 12:11:05,115 INFO L87 Difference]: Start difference. First operand 357 states and 393 transitions. Second operand has 24 states, 23 states have (on average 13.26086956521739) internal successors, (305), 24 states have internal predecessors, (305), 11 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 11 states have call predecessors, (29), 11 states have call successors, (29) [2024-11-09 12:11:06,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:11:06,617 INFO L93 Difference]: Finished difference Result 357 states and 393 transitions. [2024-11-09 12:11:06,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-11-09 12:11:06,618 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 13.26086956521739) internal successors, (305), 24 states have internal predecessors, (305), 11 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 11 states have call predecessors, (29), 11 states have call successors, (29) Word has length 319 [2024-11-09 12:11:06,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:11:06,620 INFO L225 Difference]: With dead ends: 357 [2024-11-09 12:11:06,620 INFO L226 Difference]: Without dead ends: 356 [2024-11-09 12:11:06,622 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 728 GetRequests, 672 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 724 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=511, Invalid=2795, Unknown=0, NotChecked=0, Total=3306 [2024-11-09 12:11:06,624 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 368 mSDsluCounter, 1519 mSDsCounter, 0 mSdLazyCounter, 1860 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 1660 SdHoareTripleChecker+Invalid, 1915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1860 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 12:11:06,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 1660 Invalid, 1915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1860 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 12:11:06,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2024-11-09 12:11:06,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2024-11-09 12:11:06,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 320 states have (on average 1.015625) internal successors, (325), 322 states have internal predecessors, (325), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-09 12:11:06,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 389 transitions. [2024-11-09 12:11:06,653 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 389 transitions. Word has length 319 [2024-11-09 12:11:06,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:11:06,654 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 389 transitions. [2024-11-09 12:11:06,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 13.26086956521739) internal successors, (305), 24 states have internal predecessors, (305), 11 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 11 states have call predecessors, (29), 11 states have call successors, (29) [2024-11-09 12:11:06,655 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 389 transitions. [2024-11-09 12:11:06,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2024-11-09 12:11:06,660 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:11:06,660 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1] [2024-11-09 12:11:06,680 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-09 12:11:06,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2024-11-09 12:11:06,865 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2024-11-09 12:11:06,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:11:06,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1276337688, now seen corresponding path program 3 times [2024-11-09 12:11:06,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:11:06,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256342811] [2024-11-09 12:11:06,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:11:06,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:11:06,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:07,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 12:11:07,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:07,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 12:11:07,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:07,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 12:11:07,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:07,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 12:11:07,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:07,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 12:11:07,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:07,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 12:11:07,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:07,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-09 12:11:07,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:07,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 12:11:07,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:07,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-09 12:11:07,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:07,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-09 12:11:07,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:07,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-09 12:11:07,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:07,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-09 12:11:07,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:07,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-11-09 12:11:07,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:07,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-11-09 12:11:07,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:07,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2024-11-09 12:11:07,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:07,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2024-11-09 12:11:07,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:07,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2024-11-09 12:11:07,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:07,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2024-11-09 12:11:07,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:07,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 279 [2024-11-09 12:11:07,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:07,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 290 [2024-11-09 12:11:07,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:07,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 307 [2024-11-09 12:11:07,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:07,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 324 [2024-11-09 12:11:07,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:07,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 335 [2024-11-09 12:11:07,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:07,611 INFO L134 CoverageAnalysis]: Checked inductivity of 1824 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-09 12:11:07,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:11:07,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256342811] [2024-11-09 12:11:07,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256342811] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 12:11:07,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [243110344] [2024-11-09 12:11:07,612 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 12:11:07,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:11:07,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:11:07,615 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 12:11:07,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-09 12:11:07,680 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-09 12:11:07,680 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 12:11:07,682 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-09 12:11:07,686 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:11:08,669 INFO L134 CoverageAnalysis]: Checked inductivity of 1824 backedges. 126 proven. 155 refuted. 0 times theorem prover too weak. 1543 trivial. 0 not checked. [2024-11-09 12:11:08,669 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 12:11:17,058 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-09 12:11:33,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [243110344] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 12:11:33,451 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 12:11:33,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 9] total 25 [2024-11-09 12:11:33,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748166834] [2024-11-09 12:11:33,451 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 12:11:33,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-09 12:11:33,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:11:33,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-09 12:11:33,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=879, Unknown=0, NotChecked=0, Total=992 [2024-11-09 12:11:33,455 INFO L87 Difference]: Start difference. First operand 356 states and 389 transitions. Second operand has 26 states, 25 states have (on average 11.6) internal successors, (290), 26 states have internal predecessors, (290), 11 states have call successors, (28), 1 states have call predecessors, (28), 2 states have return successors, (28), 11 states have call predecessors, (28), 11 states have call successors, (28) [2024-11-09 12:11:34,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:11:34,322 INFO L93 Difference]: Finished difference Result 358 states and 391 transitions. [2024-11-09 12:11:34,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 12:11:34,322 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 11.6) internal successors, (290), 26 states have internal predecessors, (290), 11 states have call successors, (28), 1 states have call predecessors, (28), 2 states have return successors, (28), 11 states have call predecessors, (28), 11 states have call successors, (28) Word has length 344 [2024-11-09 12:11:34,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:11:34,325 INFO L225 Difference]: With dead ends: 358 [2024-11-09 12:11:34,325 INFO L226 Difference]: Without dead ends: 356 [2024-11-09 12:11:34,326 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 449 GetRequests, 409 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=343, Invalid=1379, Unknown=0, NotChecked=0, Total=1722 [2024-11-09 12:11:34,327 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 238 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 12:11:34,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 165 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 12:11:34,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2024-11-09 12:11:34,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 351. [2024-11-09 12:11:34,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 318 states have (on average 1.0031446540880504) internal successors, (319), 318 states have internal predecessors, (319), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-09 12:11:34,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 381 transitions. [2024-11-09 12:11:34,366 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 381 transitions. Word has length 344 [2024-11-09 12:11:34,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:11:34,367 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 381 transitions. [2024-11-09 12:11:34,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 11.6) internal successors, (290), 26 states have internal predecessors, (290), 11 states have call successors, (28), 1 states have call predecessors, (28), 2 states have return successors, (28), 11 states have call predecessors, (28), 11 states have call successors, (28) [2024-11-09 12:11:34,367 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 381 transitions. [2024-11-09 12:11:34,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2024-11-09 12:11:34,370 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:11:34,370 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1] [2024-11-09 12:11:34,390 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-09 12:11:34,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:11:34,571 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2024-11-09 12:11:34,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:11:34,571 INFO L85 PathProgramCache]: Analyzing trace with hash 313678260, now seen corresponding path program 3 times [2024-11-09 12:11:34,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:11:34,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152548593] [2024-11-09 12:11:34,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:11:34,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:11:34,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 12:11:34,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [194926294] [2024-11-09 12:11:34,667 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 12:11:34,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:11:34,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:11:34,669 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 12:11:34,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-09 12:11:34,741 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-09 12:11:34,741 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 12:11:34,743 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 12:11:34,748 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:11:35,039 INFO L134 CoverageAnalysis]: Checked inductivity of 3465 backedges. 438 proven. 0 refuted. 0 times theorem prover too weak. 3027 trivial. 0 not checked. [2024-11-09 12:11:35,040 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 12:11:35,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:11:35,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152548593] [2024-11-09 12:11:35,040 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 12:11:35,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [194926294] [2024-11-09 12:11:35,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [194926294] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:11:35,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:11:35,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 12:11:35,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998618211] [2024-11-09 12:11:35,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:11:35,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 12:11:35,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:11:35,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 12:11:35,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-09 12:11:35,042 INFO L87 Difference]: Start difference. First operand 351 states and 381 transitions. Second operand has 9 states, 8 states have (on average 8.375) internal successors, (67), 9 states have internal predecessors, (67), 3 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-09 12:11:35,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:11:35,968 INFO L93 Difference]: Finished difference Result 351 states and 381 transitions. [2024-11-09 12:11:35,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 12:11:35,969 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.375) internal successors, (67), 9 states have internal predecessors, (67), 3 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 470 [2024-11-09 12:11:35,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:11:35,970 INFO L225 Difference]: With dead ends: 351 [2024-11-09 12:11:35,970 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 12:11:35,971 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 462 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2024-11-09 12:11:35,971 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 142 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 12:11:35,972 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 62 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 12:11:35,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 12:11:35,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 12:11:35,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 12:11:35,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 12:11:35,977 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 470 [2024-11-09 12:11:35,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:11:35,977 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 12:11:35,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.375) internal successors, (67), 9 states have internal predecessors, (67), 3 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-09 12:11:35,977 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 12:11:35,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 12:11:35,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 50 remaining) [2024-11-09 12:11:35,982 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 50 remaining) [2024-11-09 12:11:35,982 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 50 remaining) [2024-11-09 12:11:35,982 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 50 remaining) [2024-11-09 12:11:35,982 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 50 remaining) [2024-11-09 12:11:35,982 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 50 remaining) [2024-11-09 12:11:35,982 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 50 remaining) [2024-11-09 12:11:35,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 50 remaining) [2024-11-09 12:11:35,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 50 remaining) [2024-11-09 12:11:35,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 50 remaining) [2024-11-09 12:11:35,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 50 remaining) [2024-11-09 12:11:35,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 50 remaining) [2024-11-09 12:11:35,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 50 remaining) [2024-11-09 12:11:35,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 50 remaining) [2024-11-09 12:11:35,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 50 remaining) [2024-11-09 12:11:35,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 50 remaining) [2024-11-09 12:11:35,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 50 remaining) [2024-11-09 12:11:35,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 50 remaining) [2024-11-09 12:11:35,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 50 remaining) [2024-11-09 12:11:35,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 50 remaining) [2024-11-09 12:11:35,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 50 remaining) [2024-11-09 12:11:35,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 50 remaining) [2024-11-09 12:11:35,985 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 50 remaining) [2024-11-09 12:11:35,985 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 50 remaining) [2024-11-09 12:11:35,985 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 50 remaining) [2024-11-09 12:11:35,985 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 50 remaining) [2024-11-09 12:11:35,985 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 50 remaining) [2024-11-09 12:11:35,985 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 50 remaining) [2024-11-09 12:11:35,985 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 50 remaining) [2024-11-09 12:11:35,986 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 50 remaining) [2024-11-09 12:11:35,986 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 50 remaining) [2024-11-09 12:11:35,986 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 50 remaining) [2024-11-09 12:11:35,986 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 50 remaining) [2024-11-09 12:11:35,986 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 50 remaining) [2024-11-09 12:11:35,986 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 50 remaining) [2024-11-09 12:11:35,986 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 50 remaining) [2024-11-09 12:11:35,986 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 50 remaining) [2024-11-09 12:11:35,986 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 50 remaining) [2024-11-09 12:11:35,986 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 50 remaining) [2024-11-09 12:11:35,986 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 50 remaining) [2024-11-09 12:11:35,987 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 50 remaining) [2024-11-09 12:11:35,987 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 50 remaining) [2024-11-09 12:11:35,987 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 50 remaining) [2024-11-09 12:11:35,987 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 50 remaining) [2024-11-09 12:11:35,987 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 50 remaining) [2024-11-09 12:11:35,987 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 50 remaining) [2024-11-09 12:11:35,987 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 50 remaining) [2024-11-09 12:11:35,987 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 50 remaining) [2024-11-09 12:11:35,987 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 50 remaining) [2024-11-09 12:11:35,987 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 50 remaining) [2024-11-09 12:11:36,008 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-09 12:11:36,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:11:36,196 INFO L407 BasicCegarLoop]: Path program histogram: [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:11:36,198 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-09 12:11:37,553 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 12:11:37,588 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 12:11:37 BoogieIcfgContainer [2024-11-09 12:11:37,589 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 12:11:37,589 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 12:11:37,589 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 12:11:37,590 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 12:11:37,590 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:10:48" (3/4) ... [2024-11-09 12:11:37,593 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-09 12:11:37,597 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-11-09 12:11:37,604 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-11-09 12:11:37,604 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-09 12:11:37,604 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 12:11:37,604 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 12:11:37,712 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 12:11:37,712 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 12:11:37,712 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 12:11:37,713 INFO L158 Benchmark]: Toolchain (without parser) took 49571.99ms. Allocated memory was 130.0MB in the beginning and 249.6MB in the end (delta: 119.5MB). Free memory was 57.8MB in the beginning and 120.0MB in the end (delta: -62.2MB). Peak memory consumption was 58.6MB. Max. memory is 16.1GB. [2024-11-09 12:11:37,713 INFO L158 Benchmark]: CDTParser took 1.96ms. Allocated memory is still 130.0MB. Free memory is still 90.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 12:11:37,713 INFO L158 Benchmark]: CACSL2BoogieTranslator took 277.36ms. Allocated memory was 130.0MB in the beginning and 172.0MB in the end (delta: 41.9MB). Free memory was 57.6MB in the beginning and 135.8MB in the end (delta: -78.2MB). Peak memory consumption was 11.8MB. Max. memory is 16.1GB. [2024-11-09 12:11:37,714 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.07ms. Allocated memory is still 172.0MB. Free memory was 135.8MB in the beginning and 133.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 12:11:37,714 INFO L158 Benchmark]: Boogie Preprocessor took 34.35ms. Allocated memory is still 172.0MB. Free memory was 133.7MB in the beginning and 132.4MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 12:11:37,714 INFO L158 Benchmark]: RCFGBuilder took 469.73ms. Allocated memory is still 172.0MB. Free memory was 131.6MB in the beginning and 112.7MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-09 12:11:37,714 INFO L158 Benchmark]: TraceAbstraction took 48624.03ms. Allocated memory was 172.0MB in the beginning and 249.6MB in the end (delta: 77.6MB). Free memory was 112.7MB in the beginning and 125.2MB in the end (delta: -12.5MB). Peak memory consumption was 124.5MB. Max. memory is 16.1GB. [2024-11-09 12:11:37,715 INFO L158 Benchmark]: Witness Printer took 123.18ms. Allocated memory is still 249.6MB. Free memory was 125.2MB in the beginning and 120.0MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 12:11:37,718 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.96ms. Allocated memory is still 130.0MB. Free memory is still 90.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 277.36ms. Allocated memory was 130.0MB in the beginning and 172.0MB in the end (delta: 41.9MB). Free memory was 57.6MB in the beginning and 135.8MB in the end (delta: -78.2MB). Peak memory consumption was 11.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.07ms. Allocated memory is still 172.0MB. Free memory was 135.8MB in the beginning and 133.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.35ms. Allocated memory is still 172.0MB. Free memory was 133.7MB in the beginning and 132.4MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 469.73ms. Allocated memory is still 172.0MB. Free memory was 131.6MB in the beginning and 112.7MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 48624.03ms. Allocated memory was 172.0MB in the beginning and 249.6MB in the end (delta: 77.6MB). Free memory was 112.7MB in the beginning and 125.2MB in the end (delta: -12.5MB). Peak memory consumption was 124.5MB. Max. memory is 16.1GB. * Witness Printer took 123.18ms. Allocated memory is still 249.6MB. Free memory was 125.2MB in the beginning and 120.0MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 122 locations, 50 error locations. Started 1 CEGAR loops. OverallTime: 47.2s, OverallIterations: 22, TraceHistogramMax: 31, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 7.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2487 SdHoareTripleChecker+Valid, 5.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2427 mSDsluCounter, 6355 SdHoareTripleChecker+Invalid, 4.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4695 mSDsCounter, 331 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6489 IncrementalHoareTripleChecker+Invalid, 6820 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 331 mSolverCounterUnsat, 1660 mSDtfsCounter, 6489 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4061 GetRequests, 3814 SyntacticMatches, 0 SemanticMatches, 247 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1453 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=357occurred in iteration=19, InterpolantAutomatonStates: 188, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 22 MinimizatonAttempts, 348 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 34.1s InterpolantComputationTime, 4869 NumberOfCodeBlocks, 4172 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 5152 ConstructedInterpolants, 4 QuantifiedInterpolants, 22792 SizeOfPredicates, 12 NumberOfNonLiveVariables, 2696 ConjunctsInSsa, 124 ConjunctsInUnsatCore, 41 InterpolantComputations, 11 PerfectInterpolantSequences, 12957/16663 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 50 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((((((n <= 100) && (t == 1)) && (a == 0)) && (0 <= n)) && (s == 1)) || (((((((((((((((__int128) t * t) + ((__int128) 2 * t)) + 1) >= 0) ? (((((__int128) t * t) + ((__int128) 2 * t)) + 1) % 4) : ((((((__int128) t * t) + ((__int128) 2 * t)) + 1) % 4) + 4)) == 0) && (n <= 100)) && (((__int128) t + 1) <= s)) && (s <= 2863311528)) && (3 <= t)) && (1 <= a)) && (a <= 4611686018427387903)) && (s <= ((__int128) t + 100))) && (0 <= n))) - ProcedureContractResult [Line: 11]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Ensures: (cond != 0) RESULT: Ultimate proved your program to be correct! [2024-11-09 12:11:37,756 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE