./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_valuebound100.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_valuebound100.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 cff09967e7fcffe3595b27b82376ae61e4f296b19e01962fabf14f5a04701ff3 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 20:45:41,032 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 20:45:41,116 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-11 20:45:41,134 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 20:45:41,135 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 20:45:41,165 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 20:45:41,166 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 20:45:41,166 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 20:45:41,167 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 20:45:41,170 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 20:45:41,171 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 20:45:41,171 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 20:45:41,171 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 20:45:41,172 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 20:45:41,172 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 20:45:41,172 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 20:45:41,172 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 20:45:41,173 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 20:45:41,173 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 20:45:41,173 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 20:45:41,173 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 20:45:41,176 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 20:45:41,176 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 20:45:41,177 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 20:45:41,177 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 20:45:41,177 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 20:45:41,177 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 20:45:41,178 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 20:45:41,178 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 20:45:41,178 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 20:45:41,178 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 20:45:41,179 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 20:45:41,179 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 20:45:41,180 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 20:45:41,180 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:45:41,181 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 20:45:41,181 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 20:45:41,181 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 20:45:41,181 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 20:45:41,182 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 20:45:41,182 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 20:45:41,182 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 20:45:41,182 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 20:45:41,183 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 20:45:41,183 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-clean/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-clean/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 -> cff09967e7fcffe3595b27b82376ae61e4f296b19e01962fabf14f5a04701ff3 [2024-10-11 20:45:41,442 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 20:45:41,466 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 20:45:41,469 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 20:45:41,470 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 20:45:41,471 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 20:45:41,472 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_valuebound100.c [2024-10-11 20:45:42,847 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 20:45:43,047 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 20:45:43,048 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_valuebound100.c [2024-10-11 20:45:43,058 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7069788a0/05608511114d4b1fa8337a563eccdf05/FLAGe3b1be4fb [2024-10-11 20:45:43,074 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7069788a0/05608511114d4b1fa8337a563eccdf05 [2024-10-11 20:45:43,076 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 20:45:43,078 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 20:45:43,082 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 20:45:43,082 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 20:45:43,087 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 20:45:43,088 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:45:43" (1/1) ... [2024-10-11 20:45:43,089 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27a9f7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:45:43, skipping insertion in model container [2024-10-11 20:45:43,089 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:45:43" (1/1) ... [2024-10-11 20:45:43,112 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 20:45:43,299 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:45:43,308 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 20:45:43,331 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:45:43,345 INFO L204 MainTranslator]: Completed translation [2024-10-11 20:45:43,345 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:45:43 WrapperNode [2024-10-11 20:45:43,345 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 20:45:43,346 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 20:45:43,347 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 20:45:43,347 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 20:45:43,353 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:45:43" (1/1) ... [2024-10-11 20:45:43,360 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:45:43" (1/1) ... [2024-10-11 20:45:43,390 INFO L138 Inliner]: procedures = 14, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 155 [2024-10-11 20:45:43,391 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 20:45:43,392 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 20:45:43,392 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 20:45:43,392 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 20:45:43,403 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:45:43" (1/1) ... [2024-10-11 20:45:43,403 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:45:43" (1/1) ... [2024-10-11 20:45:43,409 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:45:43" (1/1) ... [2024-10-11 20:45:43,426 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 20:45:43,426 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:45:43" (1/1) ... [2024-10-11 20:45:43,426 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:45:43" (1/1) ... [2024-10-11 20:45:43,430 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:45:43" (1/1) ... [2024-10-11 20:45:43,433 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:45:43" (1/1) ... [2024-10-11 20:45:43,438 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:45:43" (1/1) ... [2024-10-11 20:45:43,439 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:45:43" (1/1) ... [2024-10-11 20:45:43,446 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 20:45:43,447 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 20:45:43,447 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 20:45:43,447 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 20:45:43,448 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:45:43" (1/1) ... [2024-10-11 20:45:43,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:45:43,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:45:43,485 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 20:45:43,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 20:45:43,535 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 20:45:43,535 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 20:45:43,535 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 20:45:43,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 20:45:43,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 20:45:43,536 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 20:45:43,536 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-11 20:45:43,536 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-11 20:45:43,597 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 20:45:43,600 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 20:45:44,087 INFO L? ?]: Removed 131 outVars from TransFormulas that were not future-live. [2024-10-11 20:45:44,088 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 20:45:44,129 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 20:45:44,131 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-11 20:45:44,131 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:45:44 BoogieIcfgContainer [2024-10-11 20:45:44,131 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 20:45:44,134 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 20:45:44,134 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 20:45:44,138 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 20:45:44,138 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:45:43" (1/3) ... [2024-10-11 20:45:44,139 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f047f84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:45:44, skipping insertion in model container [2024-10-11 20:45:44,140 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:45:43" (2/3) ... [2024-10-11 20:45:44,140 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f047f84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:45:44, skipping insertion in model container [2024-10-11 20:45:44,140 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:45:44" (3/3) ... [2024-10-11 20:45:44,141 INFO L112 eAbstractionObserver]: Analyzing ICFG fermat1-ll_valuebound100.c [2024-10-11 20:45:44,178 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 20:45:44,179 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 92 error locations. [2024-10-11 20:45:44,271 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 20:45:44,279 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;@4377940d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 20:45:44,280 INFO L334 AbstractCegarLoop]: Starting to check reachability of 92 error locations. [2024-10-11 20:45:44,284 INFO L276 IsEmpty]: Start isEmpty. Operand has 210 states, 107 states have (on average 1.9626168224299065) internal successors, (210), 199 states have internal predecessors, (210), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 20:45:44,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 20:45:44,291 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:45:44,292 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:45:44,292 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2024-10-11 20:45:44,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:45:44,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1466449209, now seen corresponding path program 1 times [2024-10-11 20:45:44,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:45:44,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768809784] [2024-10-11 20:45:44,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:45:44,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:45:44,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:44,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:45:44,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:44,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:45:44,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:44,462 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:45:44,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:45:44,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768809784] [2024-10-11 20:45:44,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768809784] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:45:44,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:45:44,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:45:44,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697449866] [2024-10-11 20:45:44,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:45:44,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 20:45:44,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:45:44,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 20:45:44,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 20:45:44,500 INFO L87 Difference]: Start difference. First operand has 210 states, 107 states have (on average 1.9626168224299065) internal successors, (210), 199 states have internal predecessors, (210), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 20:45:44,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:45:44,545 INFO L93 Difference]: Finished difference Result 408 states and 457 transitions. [2024-10-11 20:45:44,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 20:45:44,547 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), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 13 [2024-10-11 20:45:44,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:45:44,555 INFO L225 Difference]: With dead ends: 408 [2024-10-11 20:45:44,555 INFO L226 Difference]: Without dead ends: 197 [2024-10-11 20:45:44,558 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 20:45:44,561 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:45:44,562 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 206 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:45:44,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-10-11 20:45:44,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2024-10-11 20:45:44,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 106 states have (on average 1.7924528301886793) internal successors, (190), 187 states have internal predecessors, (190), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 20:45:44,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 204 transitions. [2024-10-11 20:45:44,601 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 204 transitions. Word has length 13 [2024-10-11 20:45:44,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:45:44,602 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 204 transitions. [2024-10-11 20:45:44,602 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), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 20:45:44,603 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 204 transitions. [2024-10-11 20:45:44,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 20:45:44,604 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:45:44,604 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:45:44,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 20:45:44,605 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2024-10-11 20:45:44,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:45:44,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1859416637, now seen corresponding path program 1 times [2024-10-11 20:45:44,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:45:44,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245239053] [2024-10-11 20:45:44,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:45:44,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:45:44,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:44,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:45:44,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:44,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:45:44,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:44,735 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:45:44,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:45:44,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245239053] [2024-10-11 20:45:44,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245239053] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:45:44,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:45:44,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:45:44,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405953854] [2024-10-11 20:45:44,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:45:44,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:45:44,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:45:44,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:45:44,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:45:44,744 INFO L87 Difference]: Start difference. First operand 197 states and 204 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 20:45:44,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:45:44,827 INFO L93 Difference]: Finished difference Result 197 states and 204 transitions. [2024-10-11 20:45:44,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:45:44,828 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), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 13 [2024-10-11 20:45:44,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:45:44,830 INFO L225 Difference]: With dead ends: 197 [2024-10-11 20:45:44,831 INFO L226 Difference]: Without dead ends: 193 [2024-10-11 20:45:44,832 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-10-11 20:45:44,833 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 13 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:45:44,835 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 350 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:45:44,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-10-11 20:45:44,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2024-10-11 20:45:44,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 106 states have (on average 1.7547169811320755) internal successors, (186), 183 states have internal predecessors, (186), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 20:45:44,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 200 transitions. [2024-10-11 20:45:44,858 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 200 transitions. Word has length 13 [2024-10-11 20:45:44,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:45:44,860 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 200 transitions. [2024-10-11 20:45:44,860 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), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 20:45:44,861 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 200 transitions. [2024-10-11 20:45:44,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 20:45:44,861 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:45:44,862 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:45:44,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 20:45:44,862 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2024-10-11 20:45:44,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:45:44,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1807340860, now seen corresponding path program 1 times [2024-10-11 20:45:44,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:45:44,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994126993] [2024-10-11 20:45:44,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:45:44,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:45:44,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:44,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:45:44,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:44,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:45:44,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:44,947 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:45:44,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:45:44,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994126993] [2024-10-11 20:45:44,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994126993] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:45:44,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:45:44,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:45:44,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853452737] [2024-10-11 20:45:44,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:45:44,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:45:44,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:45:44,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:45:44,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:45:44,954 INFO L87 Difference]: Start difference. First operand 193 states and 200 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 20:45:45,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:45:45,008 INFO L93 Difference]: Finished difference Result 193 states and 200 transitions. [2024-10-11 20:45:45,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:45:45,012 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 14 [2024-10-11 20:45:45,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:45:45,014 INFO L225 Difference]: With dead ends: 193 [2024-10-11 20:45:45,015 INFO L226 Difference]: Without dead ends: 189 [2024-10-11 20:45:45,016 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-10-11 20:45:45,017 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 12 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:45:45,020 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 350 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:45:45,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-10-11 20:45:45,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2024-10-11 20:45:45,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 106 states have (on average 1.7169811320754718) internal successors, (182), 179 states have internal predecessors, (182), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 20:45:45,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 196 transitions. [2024-10-11 20:45:45,034 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 196 transitions. Word has length 14 [2024-10-11 20:45:45,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:45:45,034 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 196 transitions. [2024-10-11 20:45:45,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 20:45:45,035 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 196 transitions. [2024-10-11 20:45:45,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 20:45:45,035 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:45:45,035 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:45:45,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 20:45:45,036 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2024-10-11 20:45:45,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:45:45,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1543402248, now seen corresponding path program 1 times [2024-10-11 20:45:45,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:45:45,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322368200] [2024-10-11 20:45:45,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:45:45,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:45:45,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 20:45:45,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1039299751] [2024-10-11 20:45:45,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:45:45,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:45:45,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:45:45,061 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:45:45,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 20:45:45,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:45,104 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 20:45:45,112 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:45:45,197 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:45:45,197 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:45:45,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:45:45,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322368200] [2024-10-11 20:45:45,198 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 20:45:45,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1039299751] [2024-10-11 20:45:45,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1039299751] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:45:45,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:45:45,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 20:45:45,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188116103] [2024-10-11 20:45:45,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:45:45,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:45:45,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:45:45,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:45:45,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:45:45,204 INFO L87 Difference]: Start difference. First operand 189 states and 196 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:45:45,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:45:45,297 INFO L93 Difference]: Finished difference Result 189 states and 196 transitions. [2024-10-11 20:45:45,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:45:45,298 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2024-10-11 20:45:45,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:45:45,299 INFO L225 Difference]: With dead ends: 189 [2024-10-11 20:45:45,299 INFO L226 Difference]: Without dead ends: 187 [2024-10-11 20:45:45,300 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:45:45,300 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 8 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:45:45,301 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 676 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:45:45,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-10-11 20:45:45,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2024-10-11 20:45:45,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 106 states have (on average 1.6981132075471699) internal successors, (180), 177 states have internal predecessors, (180), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 20:45:45,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 194 transitions. [2024-10-11 20:45:45,316 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 194 transitions. Word has length 18 [2024-10-11 20:45:45,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:45:45,317 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 194 transitions. [2024-10-11 20:45:45,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:45:45,317 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 194 transitions. [2024-10-11 20:45:45,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-11 20:45:45,322 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:45:45,322 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:45:45,338 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 20:45:45,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:45:45,523 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2024-10-11 20:45:45,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:45:45,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1365491731, now seen corresponding path program 1 times [2024-10-11 20:45:45,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:45:45,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855008089] [2024-10-11 20:45:45,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:45:45,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:45:45,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 20:45:45,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [129858178] [2024-10-11 20:45:45,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:45:45,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:45:45,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:45:45,576 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:45:45,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 20:45:45,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:45,622 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 20:45:45,623 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:45:45,745 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 20:45:45,745 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:45:45,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:45:45,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855008089] [2024-10-11 20:45:45,826 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 20:45:45,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [129858178] [2024-10-11 20:45:45,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [129858178] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:45:45,826 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:45:45,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2024-10-11 20:45:45,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274049516] [2024-10-11 20:45:45,826 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-11 20:45:45,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:45:45,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:45:45,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:45:45,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:45:45,827 INFO L87 Difference]: Start difference. First operand 187 states and 194 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 20:45:45,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:45:45,934 INFO L93 Difference]: Finished difference Result 187 states and 194 transitions. [2024-10-11 20:45:45,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:45:45,935 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 35 [2024-10-11 20:45:45,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:45:45,936 INFO L225 Difference]: With dead ends: 187 [2024-10-11 20:45:45,936 INFO L226 Difference]: Without dead ends: 184 [2024-10-11 20:45:45,937 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:45:45,938 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 144 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:45:45,938 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 469 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:45:45,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-10-11 20:45:45,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2024-10-11 20:45:45,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 106 states have (on average 1.669811320754717) internal successors, (177), 174 states have internal predecessors, (177), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 20:45:45,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 191 transitions. [2024-10-11 20:45:45,947 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 191 transitions. Word has length 35 [2024-10-11 20:45:45,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:45:45,947 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 191 transitions. [2024-10-11 20:45:45,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 20:45:45,947 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 191 transitions. [2024-10-11 20:45:45,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-11 20:45:45,948 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:45:45,948 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:45:45,965 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 20:45:46,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:45:46,149 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2024-10-11 20:45:46,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:45:46,150 INFO L85 PathProgramCache]: Analyzing trace with hash 619429364, now seen corresponding path program 1 times [2024-10-11 20:45:46,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:45:46,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110886710] [2024-10-11 20:45:46,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:45:46,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:45:46,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:46,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:45:46,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:46,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:45:46,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:46,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 20:45:46,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:46,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 20:45:46,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:46,412 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 20:45:46,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:45:46,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110886710] [2024-10-11 20:45:46,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110886710] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:45:46,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35406352] [2024-10-11 20:45:46,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:45:46,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:45:46,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:45:46,417 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:45:46,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 20:45:46,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:46,463 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 20:45:46,465 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:45:46,568 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 20:45:46,569 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:45:46,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [35406352] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:45:46,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:45:46,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-10-11 20:45:46,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220935833] [2024-10-11 20:45:46,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:45:46,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 20:45:46,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:45:46,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 20:45:46,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 20:45:46,570 INFO L87 Difference]: Start difference. First operand 184 states and 191 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 20:45:46,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:45:46,759 INFO L93 Difference]: Finished difference Result 184 states and 191 transitions. [2024-10-11 20:45:46,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 20:45:46,760 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 36 [2024-10-11 20:45:46,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:45:46,761 INFO L225 Difference]: With dead ends: 184 [2024-10-11 20:45:46,762 INFO L226 Difference]: Without dead ends: 183 [2024-10-11 20:45:46,762 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 20:45:46,763 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 143 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 20:45:46,763 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 616 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 20:45:46,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-10-11 20:45:46,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2024-10-11 20:45:46,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 106 states have (on average 1.6603773584905661) internal successors, (176), 173 states have internal predecessors, (176), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 20:45:46,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 190 transitions. [2024-10-11 20:45:46,771 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 190 transitions. Word has length 36 [2024-10-11 20:45:46,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:45:46,771 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 190 transitions. [2024-10-11 20:45:46,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 20:45:46,771 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 190 transitions. [2024-10-11 20:45:46,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-11 20:45:46,772 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:45:46,772 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:45:46,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-11 20:45:46,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:45:46,977 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2024-10-11 20:45:46,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:45:46,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1728832970, now seen corresponding path program 1 times [2024-10-11 20:45:46,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:45:46,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859369132] [2024-10-11 20:45:46,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:45:46,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:45:46,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:47,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:45:47,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:47,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:45:47,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:47,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 20:45:47,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:47,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 20:45:47,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:47,059 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 20:45:47,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:45:47,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859369132] [2024-10-11 20:45:47,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859369132] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:45:47,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:45:47,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:45:47,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749882089] [2024-10-11 20:45:47,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:45:47,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:45:47,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:45:47,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:45:47,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:45:47,061 INFO L87 Difference]: Start difference. First operand 183 states and 190 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, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 20:45:47,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:45:47,151 INFO L93 Difference]: Finished difference Result 189 states and 196 transitions. [2024-10-11 20:45:47,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:45:47,151 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, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 38 [2024-10-11 20:45:47,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:45:47,153 INFO L225 Difference]: With dead ends: 189 [2024-10-11 20:45:47,153 INFO L226 Difference]: Without dead ends: 186 [2024-10-11 20:45:47,153 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:45:47,154 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 99 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:45:47,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 218 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:45:47,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-10-11 20:45:47,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2024-10-11 20:45:47,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 110 states have (on average 1.6272727272727272) internal successors, (179), 176 states have internal predecessors, (179), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 20:45:47,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 193 transitions. [2024-10-11 20:45:47,162 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 193 transitions. Word has length 38 [2024-10-11 20:45:47,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:45:47,163 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 193 transitions. [2024-10-11 20:45:47,163 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, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 20:45:47,163 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 193 transitions. [2024-10-11 20:45:47,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-11 20:45:47,164 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:45:47,164 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:45:47,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 20:45:47,164 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2024-10-11 20:45:47,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:45:47,164 INFO L85 PathProgramCache]: Analyzing trace with hash -2054214440, now seen corresponding path program 1 times [2024-10-11 20:45:47,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:45:47,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017047051] [2024-10-11 20:45:47,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:45:47,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:45:47,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:47,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:45:47,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:47,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:45:47,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:47,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 20:45:47,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:47,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 20:45:47,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:47,217 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 20:45:47,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:45:47,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017047051] [2024-10-11 20:45:47,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017047051] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:45:47,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:45:47,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:45:47,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071793652] [2024-10-11 20:45:47,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:45:47,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:45:47,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:45:47,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:45:47,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:45:47,221 INFO L87 Difference]: Start difference. First operand 186 states and 193 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 20:45:47,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:45:47,336 INFO L93 Difference]: Finished difference Result 190 states and 197 transitions. [2024-10-11 20:45:47,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:45:47,337 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 39 [2024-10-11 20:45:47,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:45:47,338 INFO L225 Difference]: With dead ends: 190 [2024-10-11 20:45:47,338 INFO L226 Difference]: Without dead ends: 187 [2024-10-11 20:45:47,338 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:45:47,339 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 109 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:45:47,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 331 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:45:47,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-10-11 20:45:47,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2024-10-11 20:45:47,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 112 states have (on average 1.6071428571428572) internal successors, (180), 177 states have internal predecessors, (180), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 20:45:47,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 194 transitions. [2024-10-11 20:45:47,346 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 194 transitions. Word has length 39 [2024-10-11 20:45:47,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:45:47,347 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 194 transitions. [2024-10-11 20:45:47,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 20:45:47,347 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 194 transitions. [2024-10-11 20:45:47,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-11 20:45:47,348 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:45:47,348 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:45:47,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 20:45:47,348 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2024-10-11 20:45:47,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:45:47,349 INFO L85 PathProgramCache]: Analyzing trace with hash 743861880, now seen corresponding path program 1 times [2024-10-11 20:45:47,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:45:47,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28557096] [2024-10-11 20:45:47,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:45:47,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:45:47,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 20:45:47,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1706072264] [2024-10-11 20:45:47,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:45:47,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:45:47,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:45:47,363 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:45:47,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 20:45:47,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:47,416 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 20:45:47,417 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:45:47,437 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 20:45:47,437 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:45:47,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:45:47,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28557096] [2024-10-11 20:45:47,437 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 20:45:47,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1706072264] [2024-10-11 20:45:47,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1706072264] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:45:47,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:45:47,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:45:47,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25609098] [2024-10-11 20:45:47,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:45:47,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:45:47,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:45:47,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:45:47,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:45:47,440 INFO L87 Difference]: Start difference. First operand 187 states and 194 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 20:45:47,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:45:47,545 INFO L93 Difference]: Finished difference Result 293 states and 313 transitions. [2024-10-11 20:45:47,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:45:47,546 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 40 [2024-10-11 20:45:47,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:45:47,548 INFO L225 Difference]: With dead ends: 293 [2024-10-11 20:45:47,548 INFO L226 Difference]: Without dead ends: 290 [2024-10-11 20:45:47,548 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:45:47,549 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 97 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:45:47,549 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 305 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:45:47,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2024-10-11 20:45:47,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 250. [2024-10-11 20:45:47,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 172 states have (on average 1.6395348837209303) internal successors, (282), 237 states have internal predecessors, (282), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-11 20:45:47,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 302 transitions. [2024-10-11 20:45:47,560 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 302 transitions. Word has length 40 [2024-10-11 20:45:47,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:45:47,561 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 302 transitions. [2024-10-11 20:45:47,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 20:45:47,561 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 302 transitions. [2024-10-11 20:45:47,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-11 20:45:47,562 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:45:47,562 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:45:47,579 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 20:45:47,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-10-11 20:45:47,767 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2024-10-11 20:45:47,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:45:47,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1584881882, now seen corresponding path program 1 times [2024-10-11 20:45:47,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:45:47,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293860013] [2024-10-11 20:45:47,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:45:47,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:45:47,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:47,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:45:47,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:47,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:45:47,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:47,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 20:45:47,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:47,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 20:45:47,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:47,941 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 20:45:47,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:45:47,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293860013] [2024-10-11 20:45:47,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293860013] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:45:47,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [532400348] [2024-10-11 20:45:47,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:45:47,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:45:47,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:45:47,950 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:45:47,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 20:45:47,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:47,993 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 20:45:47,995 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:45:48,198 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 20:45:48,198 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:45:48,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [532400348] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:45:48,448 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 20:45:48,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2024-10-11 20:45:48,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307773231] [2024-10-11 20:45:48,448 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 20:45:48,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 20:45:48,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:45:48,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 20:45:48,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2024-10-11 20:45:48,450 INFO L87 Difference]: Start difference. First operand 250 states and 302 transitions. Second operand has 11 states, 10 states have (on average 4.7) internal successors, (47), 11 states have internal predecessors, (47), 5 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2024-10-11 20:45:49,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-10-11 20:45:50,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:45:50,117 INFO L93 Difference]: Finished difference Result 391 states and 422 transitions. [2024-10-11 20:45:50,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 20:45:50,117 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.7) internal successors, (47), 11 states have internal predecessors, (47), 5 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 41 [2024-10-11 20:45:50,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:45:50,120 INFO L225 Difference]: With dead ends: 391 [2024-10-11 20:45:50,120 INFO L226 Difference]: Without dead ends: 388 [2024-10-11 20:45:50,120 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2024-10-11 20:45:50,121 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 604 mSDsluCounter, 724 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 18 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 610 SdHoareTripleChecker+Valid, 854 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-11 20:45:50,121 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [610 Valid, 854 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 374 Invalid, 1 Unknown, 0 Unchecked, 1.6s Time] [2024-10-11 20:45:50,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2024-10-11 20:45:50,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 294. [2024-10-11 20:45:50,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 214 states have (on average 1.6355140186915889) internal successors, (350), 279 states have internal predecessors, (350), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 20:45:50,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 374 transitions. [2024-10-11 20:45:50,138 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 374 transitions. Word has length 41 [2024-10-11 20:45:50,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:45:50,139 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 374 transitions. [2024-10-11 20:45:50,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.7) internal successors, (47), 11 states have internal predecessors, (47), 5 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2024-10-11 20:45:50,139 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 374 transitions. [2024-10-11 20:45:50,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-11 20:45:50,140 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:45:50,141 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:45:50,157 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-11 20:45:50,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-11 20:45:50,345 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2024-10-11 20:45:50,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:45:50,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1641898788, now seen corresponding path program 1 times [2024-10-11 20:45:50,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:45:50,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971975379] [2024-10-11 20:45:50,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:45:50,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:45:50,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 20:45:50,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [594150106] [2024-10-11 20:45:50,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:45:50,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:45:50,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:45:50,361 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:45:50,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 20:45:50,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:50,404 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 20:45:50,406 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:45:50,577 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 20:45:50,577 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:45:50,700 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 20:45:50,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:45:50,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971975379] [2024-10-11 20:45:50,701 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 20:45:50,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [594150106] [2024-10-11 20:45:50,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [594150106] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:45:50,701 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 20:45:50,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-11 20:45:50,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238449039] [2024-10-11 20:45:50,701 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 20:45:50,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 20:45:50,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:45:50,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 20:45:50,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-11 20:45:50,702 INFO L87 Difference]: Start difference. First operand 294 states and 374 transitions. Second operand has 9 states, 8 states have (on average 6.5) internal successors, (52), 9 states have internal predecessors, (52), 3 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 20:45:51,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:45:51,777 INFO L93 Difference]: Finished difference Result 428 states and 546 transitions. [2024-10-11 20:45:51,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 20:45:51,777 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 9 states have internal predecessors, (52), 3 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 43 [2024-10-11 20:45:51,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:45:51,780 INFO L225 Difference]: With dead ends: 428 [2024-10-11 20:45:51,780 INFO L226 Difference]: Without dead ends: 401 [2024-10-11 20:45:51,780 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-11 20:45:51,781 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 310 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:45:51,781 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 594 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 20:45:51,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2024-10-11 20:45:51,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 375. [2024-10-11 20:45:51,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 309 states have (on average 1.4401294498381878) internal successors, (445), 357 states have internal predecessors, (445), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 20:45:51,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 475 transitions. [2024-10-11 20:45:51,806 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 475 transitions. Word has length 43 [2024-10-11 20:45:51,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:45:51,806 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 475 transitions. [2024-10-11 20:45:51,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 9 states have internal predecessors, (52), 3 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 20:45:51,807 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 475 transitions. [2024-10-11 20:45:51,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-11 20:45:51,809 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:45:51,809 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:45:51,826 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 20:45:52,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-11 20:45:52,010 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2024-10-11 20:45:52,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:45:52,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1611734818, now seen corresponding path program 1 times [2024-10-11 20:45:52,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:45:52,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971311298] [2024-10-11 20:45:52,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:45:52,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:45:52,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 20:45:52,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [506217961] [2024-10-11 20:45:52,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:45:52,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:45:52,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:45:52,027 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:45:52,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 20:45:52,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:52,068 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 20:45:52,069 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:45:52,094 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 20:45:52,094 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:45:52,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:45:52,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971311298] [2024-10-11 20:45:52,094 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 20:45:52,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [506217961] [2024-10-11 20:45:52,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [506217961] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:45:52,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:45:52,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:45:52,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376276924] [2024-10-11 20:45:52,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:45:52,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:45:52,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:45:52,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:45:52,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:45:52,097 INFO L87 Difference]: Start difference. First operand 375 states and 475 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, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 20:45:52,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:45:52,298 INFO L93 Difference]: Finished difference Result 576 states and 729 transitions. [2024-10-11 20:45:52,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:45:52,298 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, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 45 [2024-10-11 20:45:52,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:45:52,301 INFO L225 Difference]: With dead ends: 576 [2024-10-11 20:45:52,301 INFO L226 Difference]: Without dead ends: 535 [2024-10-11 20:45:52,301 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:45:52,302 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 88 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 20:45:52,304 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 207 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 20:45:52,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2024-10-11 20:45:52,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 523. [2024-10-11 20:45:52,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 452 states have (on average 1.3473451327433628) internal successors, (609), 500 states have internal predecessors, (609), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 20:45:52,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 649 transitions. [2024-10-11 20:45:52,331 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 649 transitions. Word has length 45 [2024-10-11 20:45:52,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:45:52,331 INFO L471 AbstractCegarLoop]: Abstraction has 523 states and 649 transitions. [2024-10-11 20:45:52,331 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, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 20:45:52,331 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 649 transitions. [2024-10-11 20:45:52,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-11 20:45:52,333 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:45:52,334 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:45:52,350 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-11 20:45:52,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:45:52,538 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2024-10-11 20:45:52,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:45:52,538 INFO L85 PathProgramCache]: Analyzing trace with hash -707959789, now seen corresponding path program 1 times [2024-10-11 20:45:52,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:45:52,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039397802] [2024-10-11 20:45:52,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:45:52,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:45:52,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:52,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:45:52,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:52,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:45:52,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:52,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 20:45:52,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:52,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 20:45:52,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:52,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 20:45:52,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:52,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 20:45:52,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:52,689 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-11 20:45:52,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:45:52,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039397802] [2024-10-11 20:45:52,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039397802] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:45:52,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:45:52,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:45:52,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847714842] [2024-10-11 20:45:52,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:45:52,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:45:52,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:45:52,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:45:52,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:45:52,691 INFO L87 Difference]: Start difference. First operand 523 states and 649 transitions. Second operand has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 20:45:52,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:45:52,952 INFO L93 Difference]: Finished difference Result 536 states and 650 transitions. [2024-10-11 20:45:52,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:45:52,953 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 87 [2024-10-11 20:45:52,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:45:52,955 INFO L225 Difference]: With dead ends: 536 [2024-10-11 20:45:52,955 INFO L226 Difference]: Without dead ends: 535 [2024-10-11 20:45:52,955 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:45:52,956 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 56 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 20:45:52,956 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 282 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 20:45:52,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2024-10-11 20:45:52,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 523. [2024-10-11 20:45:52,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 452 states have (on average 1.342920353982301) internal successors, (607), 500 states have internal predecessors, (607), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 20:45:52,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 647 transitions. [2024-10-11 20:45:52,978 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 647 transitions. Word has length 87 [2024-10-11 20:45:52,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:45:52,978 INFO L471 AbstractCegarLoop]: Abstraction has 523 states and 647 transitions. [2024-10-11 20:45:52,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 20:45:52,978 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 647 transitions. [2024-10-11 20:45:52,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-11 20:45:52,979 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:45:52,979 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:45:52,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 20:45:52,980 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2024-10-11 20:45:52,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:45:52,980 INFO L85 PathProgramCache]: Analyzing trace with hash -471916808, now seen corresponding path program 1 times [2024-10-11 20:45:52,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:45:52,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510699469] [2024-10-11 20:45:52,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:45:52,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:45:52,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:53,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:45:53,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:53,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:45:53,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:53,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 20:45:53,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:53,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 20:45:53,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:53,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 20:45:53,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:53,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 20:45:53,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:53,127 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-11 20:45:53,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:45:53,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510699469] [2024-10-11 20:45:53,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510699469] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:45:53,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:45:53,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 20:45:53,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959709626] [2024-10-11 20:45:53,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:45:53,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:45:53,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:45:53,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:45:53,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:45:53,131 INFO L87 Difference]: Start difference. First operand 523 states and 647 transitions. Second operand has 5 states, 4 states have (on average 16.0) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 20:45:53,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:45:53,506 INFO L93 Difference]: Finished difference Result 533 states and 653 transitions. [2024-10-11 20:45:53,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:45:53,506 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.0) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 88 [2024-10-11 20:45:53,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:45:53,509 INFO L225 Difference]: With dead ends: 533 [2024-10-11 20:45:53,509 INFO L226 Difference]: Without dead ends: 532 [2024-10-11 20:45:53,509 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:45:53,510 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 252 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 20:45:53,510 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 224 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 20:45:53,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2024-10-11 20:45:53,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 523. [2024-10-11 20:45:53,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 452 states have (on average 1.3384955752212389) internal successors, (605), 500 states have internal predecessors, (605), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 20:45:53,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 645 transitions. [2024-10-11 20:45:53,535 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 645 transitions. Word has length 88 [2024-10-11 20:45:53,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:45:53,535 INFO L471 AbstractCegarLoop]: Abstraction has 523 states and 645 transitions. [2024-10-11 20:45:53,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.0) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 20:45:53,535 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 645 transitions. [2024-10-11 20:45:53,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 20:45:53,536 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:45:53,538 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:45:53,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 20:45:53,538 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2024-10-11 20:45:53,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:45:53,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1860687940, now seen corresponding path program 1 times [2024-10-11 20:45:53,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:45:53,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400668018] [2024-10-11 20:45:53,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:45:53,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:45:53,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:53,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:45:53,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:53,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:45:53,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:53,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 20:45:53,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:53,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 20:45:53,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:53,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 20:45:53,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:53,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 20:45:53,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:53,728 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-11 20:45:53,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:45:53,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400668018] [2024-10-11 20:45:53,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400668018] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:45:53,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1923739857] [2024-10-11 20:45:53,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:45:53,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:45:53,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:45:53,731 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:45:53,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 20:45:53,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:53,781 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 20:45:53,783 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:45:53,998 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-11 20:45:53,998 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:45:54,161 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-11 20:45:54,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1923739857] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:45:54,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:45:54,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 13 [2024-10-11 20:45:54,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618821297] [2024-10-11 20:45:54,162 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:45:54,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 20:45:54,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:45:54,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 20:45:54,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2024-10-11 20:45:54,163 INFO L87 Difference]: Start difference. First operand 523 states and 645 transitions. Second operand has 14 states, 13 states have (on average 13.923076923076923) internal successors, (181), 14 states have internal predecessors, (181), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2024-10-11 20:45:55,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:45:55,267 INFO L93 Difference]: Finished difference Result 1137 states and 1403 transitions. [2024-10-11 20:45:55,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 20:45:55,268 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 13.923076923076923) internal successors, (181), 14 states have internal predecessors, (181), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) Word has length 92 [2024-10-11 20:45:55,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:45:55,272 INFO L225 Difference]: With dead ends: 1137 [2024-10-11 20:45:55,272 INFO L226 Difference]: Without dead ends: 638 [2024-10-11 20:45:55,276 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=209, Invalid=391, Unknown=0, NotChecked=0, Total=600 [2024-10-11 20:45:55,277 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 878 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 1139 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 878 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 1194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 20:45:55,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [878 Valid, 490 Invalid, 1194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1139 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 20:45:55,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2024-10-11 20:45:55,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 600. [2024-10-11 20:45:55,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 527 states have (on average 1.3187855787476281) internal successors, (695), 573 states have internal predecessors, (695), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 20:45:55,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 743 transitions. [2024-10-11 20:45:55,305 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 743 transitions. Word has length 92 [2024-10-11 20:45:55,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:45:55,306 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 743 transitions. [2024-10-11 20:45:55,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 13.923076923076923) internal successors, (181), 14 states have internal predecessors, (181), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2024-10-11 20:45:55,307 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 743 transitions. [2024-10-11 20:45:55,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-11 20:45:55,308 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:45:55,308 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:45:55,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-11 20:45:55,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-11 20:45:55,510 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2024-10-11 20:45:55,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:45:55,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1846751163, now seen corresponding path program 1 times [2024-10-11 20:45:55,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:45:55,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138628536] [2024-10-11 20:45:55,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:45:55,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:45:55,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:55,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:45:55,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:55,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:45:55,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:55,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 20:45:55,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:55,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 20:45:55,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:55,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 20:45:55,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:55,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 20:45:55,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:55,625 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-11 20:45:55,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:45:55,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138628536] [2024-10-11 20:45:55,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138628536] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:45:55,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1894774973] [2024-10-11 20:45:55,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:45:55,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:45:55,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:45:55,628 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:45:55,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-11 20:45:55,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:55,679 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 20:45:55,681 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:46:11,084 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~R~0#1_51| Int)) (let ((.cse0 (* |v_ULTIMATE.start_main_~R~0#1_51| |v_ULTIMATE.start_main_~R~0#1_51|))) (and (<= .cse0 9223372036854775807) (<= (+ |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~A~0#1| 1) .cse0)))) is different from true [2024-10-11 20:46:11,110 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 3 not checked. [2024-10-11 20:46:11,111 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:46:11,263 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-11 20:46:11,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1894774973] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:46:11,264 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:46:11,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2024-10-11 20:46:11,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443386860] [2024-10-11 20:46:11,264 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:46:11,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 20:46:11,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:46:11,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 20:46:11,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=106, Unknown=6, NotChecked=22, Total=182 [2024-10-11 20:46:11,265 INFO L87 Difference]: Start difference. First operand 600 states and 743 transitions. Second operand has 14 states, 13 states have (on average 13.307692307692308) internal successors, (173), 14 states have internal predecessors, (173), 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-10-11 20:46:12,375 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-10-11 20:46:14,627 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-10-11 20:46:20,117 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-10-11 20:46:21,210 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-10-11 20:46:22,257 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-10-11 20:46:26,275 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-10-11 20:46:27,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-10-11 20:46:31,354 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-10-11 20:46:32,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-10-11 20:46:36,170 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.60s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-10-11 20:46:37,205 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-10-11 20:46:43,266 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-10-11 20:46:47,272 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-10-11 20:46:48,327 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-10-11 20:46:49,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-10-11 20:46:50,714 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-10-11 20:46:54,823 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-10-11 20:46:55,910 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-10-11 20:46:56,975 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-10-11 20:46:58,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-10-11 20:47:02,053 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-10-11 20:47:06,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-10-11 20:47:07,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-10-11 20:47:11,216 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-10-11 20:47:15,232 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-10-11 20:47:16,389 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-10-11 20:47:21,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0]