./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound20.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound20.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c16561338eb70030ddc560fe6b7af6d1b48b7a566766a02092344cb5475a4c1a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 04:30:12,078 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 04:30:12,153 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-17 04:30:12,156 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 04:30:12,157 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 04:30:12,176 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 04:30:12,176 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 04:30:12,177 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 04:30:12,177 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 04:30:12,178 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 04:30:12,178 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 04:30:12,178 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 04:30:12,179 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 04:30:12,179 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 04:30:12,180 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 04:30:12,180 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 04:30:12,181 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-17 04:30:12,181 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 04:30:12,181 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 04:30:12,182 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 04:30:12,182 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 04:30:12,182 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-17 04:30:12,183 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 04:30:12,183 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-17 04:30:12,183 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 04:30:12,184 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-17 04:30:12,184 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 04:30:12,184 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 04:30:12,185 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-17 04:30:12,185 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 04:30:12,186 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 04:30:12,186 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 04:30:12,186 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 04:30:12,187 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 04:30:12,187 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 04:30:12,187 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 04:30:12,187 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 04:30:12,188 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-17 04:30:12,188 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 04:30:12,188 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 04:30:12,189 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 04:30:12,190 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 04:30:12,190 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 04:30:12,190 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 04:30:12,190 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c16561338eb70030ddc560fe6b7af6d1b48b7a566766a02092344cb5475a4c1a [2024-11-17 04:30:12,421 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 04:30:12,447 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 04:30:12,451 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 04:30:12,452 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 04:30:12,452 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 04:30:12,454 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound20.c [2024-11-17 04:30:13,864 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 04:30:14,019 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 04:30:14,020 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound20.c [2024-11-17 04:30:14,026 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ee0c840b/f036e96e6bcb4c7199d71ed23b17ef9b/FLAG196ba086b [2024-11-17 04:30:14,429 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ee0c840b/f036e96e6bcb4c7199d71ed23b17ef9b [2024-11-17 04:30:14,432 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 04:30:14,433 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 04:30:14,434 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 04:30:14,434 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 04:30:14,440 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 04:30:14,441 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 04:30:14" (1/1) ... [2024-11-17 04:30:14,441 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c0e6aa3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:30:14, skipping insertion in model container [2024-11-17 04:30:14,442 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 04:30:14" (1/1) ... [2024-11-17 04:30:14,460 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 04:30:14,648 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 04:30:14,656 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 04:30:14,674 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 04:30:14,690 INFO L204 MainTranslator]: Completed translation [2024-11-17 04:30:14,691 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:30:14 WrapperNode [2024-11-17 04:30:14,691 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 04:30:14,692 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 04:30:14,693 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 04:30:14,693 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 04:30:14,699 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:30:14" (1/1) ... [2024-11-17 04:30:14,711 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:30:14" (1/1) ... [2024-11-17 04:30:14,744 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 110 [2024-11-17 04:30:14,744 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 04:30:14,745 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 04:30:14,745 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 04:30:14,745 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 04:30:14,757 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:30:14" (1/1) ... [2024-11-17 04:30:14,757 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:30:14" (1/1) ... [2024-11-17 04:30:14,759 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:30:14" (1/1) ... [2024-11-17 04:30:14,771 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-17 04:30:14,772 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:30:14" (1/1) ... [2024-11-17 04:30:14,772 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:30:14" (1/1) ... [2024-11-17 04:30:14,775 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:30:14" (1/1) ... [2024-11-17 04:30:14,776 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:30:14" (1/1) ... [2024-11-17 04:30:14,776 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:30:14" (1/1) ... [2024-11-17 04:30:14,777 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:30:14" (1/1) ... [2024-11-17 04:30:14,779 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 04:30:14,780 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 04:30:14,782 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 04:30:14,782 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 04:30:14,783 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:30:14" (1/1) ... [2024-11-17 04:30:14,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 04:30:14,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 04:30:14,821 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-17 04:30:14,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-17 04:30:14,862 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 04:30:14,862 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-17 04:30:14,862 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-17 04:30:14,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-17 04:30:14,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 04:30:14,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 04:30:14,863 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-17 04:30:14,863 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-17 04:30:14,929 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 04:30:14,931 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 04:30:15,309 INFO L? ?]: Removed 81 outVars from TransFormulas that were not future-live. [2024-11-17 04:30:15,310 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 04:30:15,329 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 04:30:15,329 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 04:30:15,330 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 04:30:15 BoogieIcfgContainer [2024-11-17 04:30:15,330 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 04:30:15,332 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 04:30:15,332 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 04:30:15,335 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 04:30:15,336 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 04:30:14" (1/3) ... [2024-11-17 04:30:15,336 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c8e9f67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 04:30:15, skipping insertion in model container [2024-11-17 04:30:15,337 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:30:14" (2/3) ... [2024-11-17 04:30:15,338 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c8e9f67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 04:30:15, skipping insertion in model container [2024-11-17 04:30:15,338 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 04:30:15" (3/3) ... [2024-11-17 04:30:15,339 INFO L112 eAbstractionObserver]: Analyzing ICFG fermat2-ll_unwindbound20.c [2024-11-17 04:30:15,354 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 04:30:15,354 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 58 error locations. [2024-11-17 04:30:15,411 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 04:30:15,418 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;@7310591d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 04:30:15,418 INFO L334 AbstractCegarLoop]: Starting to check reachability of 58 error locations. [2024-11-17 04:30:15,423 INFO L276 IsEmpty]: Start isEmpty. Operand has 147 states, 82 states have (on average 1.7804878048780488) internal successors, (146), 140 states have internal predecessors, (146), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-17 04:30:15,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-17 04:30:15,429 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:30:15,430 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-17 04:30:15,431 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr57ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2024-11-17 04:30:15,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:30:15,437 INFO L85 PathProgramCache]: Analyzing trace with hash 167785, now seen corresponding path program 1 times [2024-11-17 04:30:15,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:30:15,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159496293] [2024-11-17 04:30:15,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:30:15,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:30:15,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:30:15,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 04:30:15,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:30:15,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159496293] [2024-11-17 04:30:15,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159496293] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 04:30:15,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 04:30:15,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 04:30:15,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644537203] [2024-11-17 04:30:15,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 04:30:15,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 04:30:15,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:30:15,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 04:30:15,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 04:30:15,681 INFO L87 Difference]: Start difference. First operand has 147 states, 82 states have (on average 1.7804878048780488) internal successors, (146), 140 states have internal predecessors, (146), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 04:30:15,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:30:15,773 INFO L93 Difference]: Finished difference Result 271 states and 295 transitions. [2024-11-17 04:30:15,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 04:30:15,775 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-17 04:30:15,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:30:15,781 INFO L225 Difference]: With dead ends: 271 [2024-11-17 04:30:15,782 INFO L226 Difference]: Without dead ends: 130 [2024-11-17 04:30:15,784 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 04:30:15,787 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 15 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 04:30:15,788 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 228 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 04:30:15,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-17 04:30:15,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2024-11-17 04:30:15,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 77 states have (on average 1.6493506493506493) internal successors, (127), 124 states have internal predecessors, (127), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 04:30:15,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 133 transitions. [2024-11-17 04:30:15,827 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 133 transitions. Word has length 3 [2024-11-17 04:30:15,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:30:15,827 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 133 transitions. [2024-11-17 04:30:15,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 04:30:15,828 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 133 transitions. [2024-11-17 04:30:15,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-17 04:30:15,828 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:30:15,829 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-17 04:30:15,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-17 04:30:15,829 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2024-11-17 04:30:15,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:30:15,830 INFO L85 PathProgramCache]: Analyzing trace with hash 5201439, now seen corresponding path program 1 times [2024-11-17 04:30:15,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:30:15,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137787790] [2024-11-17 04:30:15,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:30:15,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:30:15,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:30:15,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 04:30:15,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:30:15,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137787790] [2024-11-17 04:30:15,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137787790] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 04:30:15,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 04:30:15,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 04:30:15,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748528036] [2024-11-17 04:30:15,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 04:30:15,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 04:30:15,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:30:15,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 04:30:15,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 04:30:15,876 INFO L87 Difference]: Start difference. First operand 130 states and 133 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 04:30:15,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:30:15,933 INFO L93 Difference]: Finished difference Result 130 states and 133 transitions. [2024-11-17 04:30:15,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 04:30:15,936 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-17 04:30:15,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:30:15,938 INFO L225 Difference]: With dead ends: 130 [2024-11-17 04:30:15,938 INFO L226 Difference]: Without dead ends: 126 [2024-11-17 04:30:15,938 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 04:30:15,941 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 14 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 215 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-11-17 04:30:15,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 215 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 04:30:15,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-17 04:30:15,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2024-11-17 04:30:15,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 77 states have (on average 1.5974025974025974) internal successors, (123), 120 states have internal predecessors, (123), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 04:30:15,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 129 transitions. [2024-11-17 04:30:15,965 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 129 transitions. Word has length 4 [2024-11-17 04:30:15,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:30:15,966 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 129 transitions. [2024-11-17 04:30:15,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 04:30:15,966 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 129 transitions. [2024-11-17 04:30:15,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-17 04:30:15,966 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:30:15,966 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 04:30:15,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-17 04:30:15,967 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2024-11-17 04:30:15,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:30:15,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1867847707, now seen corresponding path program 1 times [2024-11-17 04:30:15,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:30:15,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349082216] [2024-11-17 04:30:15,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:30:15,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:30:15,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-17 04:30:15,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [796735062] [2024-11-17 04:30:15,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:30:15,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 04:30:15,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 04:30:15,993 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 04:30:15,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-17 04:30:16,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:30:16,046 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 04:30:16,053 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 04:30:16,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 04:30:16,119 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 04:30:16,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:30:16,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349082216] [2024-11-17 04:30:16,121 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-17 04:30:16,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796735062] [2024-11-17 04:30:16,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [796735062] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 04:30:16,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 04:30:16,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 04:30:16,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585803798] [2024-11-17 04:30:16,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 04:30:16,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 04:30:16,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:30:16,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 04:30:16,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 04:30:16,126 INFO L87 Difference]: Start difference. First operand 126 states and 129 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 04:30:16,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:30:16,168 INFO L93 Difference]: Finished difference Result 126 states and 129 transitions. [2024-11-17 04:30:16,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 04:30:16,171 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-17 04:30:16,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:30:16,172 INFO L225 Difference]: With dead ends: 126 [2024-11-17 04:30:16,172 INFO L226 Difference]: Without dead ends: 124 [2024-11-17 04:30:16,173 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 04:30:16,174 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 10 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 04:30:16,175 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 215 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 04:30:16,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-17 04:30:16,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2024-11-17 04:30:16,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 77 states have (on average 1.5714285714285714) internal successors, (121), 118 states have internal predecessors, (121), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 04:30:16,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 127 transitions. [2024-11-17 04:30:16,184 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 127 transitions. Word has length 8 [2024-11-17 04:30:16,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:30:16,184 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 127 transitions. [2024-11-17 04:30:16,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 04:30:16,185 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 127 transitions. [2024-11-17 04:30:16,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-17 04:30:16,186 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:30:16,186 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 04:30:16,199 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-17 04:30:16,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 04:30:16,387 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2024-11-17 04:30:16,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:30:16,388 INFO L85 PathProgramCache]: Analyzing trace with hash -625123825, now seen corresponding path program 1 times [2024-11-17 04:30:16,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:30:16,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328334232] [2024-11-17 04:30:16,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:30:16,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:30:16,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-17 04:30:16,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [573729781] [2024-11-17 04:30:16,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:30:16,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 04:30:16,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 04:30:16,434 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 04:30:16,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-17 04:30:16,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:30:16,479 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 04:30:16,481 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 04:30:16,528 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-17 04:30:16,529 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 04:30:16,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:30:16,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328334232] [2024-11-17 04:30:16,530 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-17 04:30:16,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [573729781] [2024-11-17 04:30:16,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [573729781] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 04:30:16,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 04:30:16,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 04:30:16,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342925397] [2024-11-17 04:30:16,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 04:30:16,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 04:30:16,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:30:16,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 04:30:16,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 04:30:16,533 INFO L87 Difference]: Start difference. First operand 124 states and 127 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 04:30:16,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:30:16,568 INFO L93 Difference]: Finished difference Result 124 states and 127 transitions. [2024-11-17 04:30:16,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 04:30:16,569 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2024-11-17 04:30:16,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:30:16,570 INFO L225 Difference]: With dead ends: 124 [2024-11-17 04:30:16,570 INFO L226 Difference]: Without dead ends: 122 [2024-11-17 04:30:16,571 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 04:30:16,571 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 92 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 04:30:16,572 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 120 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 04:30:16,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-17 04:30:16,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-11-17 04:30:16,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 77 states have (on average 1.5454545454545454) internal successors, (119), 116 states have internal predecessors, (119), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 04:30:16,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 125 transitions. [2024-11-17 04:30:16,589 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 125 transitions. Word has length 26 [2024-11-17 04:30:16,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:30:16,591 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 125 transitions. [2024-11-17 04:30:16,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 04:30:16,592 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 125 transitions. [2024-11-17 04:30:16,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-17 04:30:16,593 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:30:16,593 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 04:30:16,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-17 04:30:16,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-17 04:30:16,795 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2024-11-17 04:30:16,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:30:16,795 INFO L85 PathProgramCache]: Analyzing trace with hash 2095997982, now seen corresponding path program 1 times [2024-11-17 04:30:16,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:30:16,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884331372] [2024-11-17 04:30:16,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:30:16,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:30:16,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:30:17,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-17 04:30:17,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:30:17,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-17 04:30:17,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:30:17,089 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-17 04:30:17,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:30:17,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884331372] [2024-11-17 04:30:17,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884331372] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 04:30:17,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [358025837] [2024-11-17 04:30:17,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:30:17,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 04:30:17,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 04:30:17,092 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 04:30:17,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-17 04:30:17,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:30:17,141 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-17 04:30:17,143 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 04:30:17,543 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-17 04:30:17,543 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 04:30:17,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [358025837] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 04:30:17,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-17 04:30:17,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-11-17 04:30:17,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275498030] [2024-11-17 04:30:17,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 04:30:17,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 04:30:17,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:30:17,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 04:30:17,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-17 04:30:17,546 INFO L87 Difference]: Start difference. First operand 122 states and 125 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 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-11-17 04:30:17,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:30:17,674 INFO L93 Difference]: Finished difference Result 122 states and 125 transitions. [2024-11-17 04:30:17,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 04:30:17,674 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 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 27 [2024-11-17 04:30:17,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:30:17,676 INFO L225 Difference]: With dead ends: 122 [2024-11-17 04:30:17,676 INFO L226 Difference]: Without dead ends: 120 [2024-11-17 04:30:17,676 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-17 04:30:17,677 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 91 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 04:30:17,677 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 421 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 04:30:17,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-17 04:30:17,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-11-17 04:30:17,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 77 states have (on average 1.5194805194805194) internal successors, (117), 114 states have internal predecessors, (117), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 04:30:17,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 123 transitions. [2024-11-17 04:30:17,685 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 123 transitions. Word has length 27 [2024-11-17 04:30:17,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:30:17,685 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 123 transitions. [2024-11-17 04:30:17,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 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-11-17 04:30:17,686 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 123 transitions. [2024-11-17 04:30:17,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-17 04:30:17,686 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:30:17,686 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 04:30:17,703 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-17 04:30:17,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 04:30:17,891 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2024-11-17 04:30:17,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:30:17,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1641407916, now seen corresponding path program 1 times [2024-11-17 04:30:17,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:30:17,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212216978] [2024-11-17 04:30:17,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:30:17,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:30:17,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:30:17,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-17 04:30:17,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:30:17,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-17 04:30:17,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:30:17,991 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-17 04:30:17,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:30:17,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212216978] [2024-11-17 04:30:17,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212216978] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 04:30:17,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 04:30:17,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 04:30:17,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633645949] [2024-11-17 04:30:17,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 04:30:17,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 04:30:17,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:30:17,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 04:30:17,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 04:30:17,996 INFO L87 Difference]: Start difference. First operand 120 states and 123 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 04:30:18,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:30:18,027 INFO L93 Difference]: Finished difference Result 155 states and 158 transitions. [2024-11-17 04:30:18,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 04:30:18,027 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2024-11-17 04:30:18,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:30:18,029 INFO L225 Difference]: With dead ends: 155 [2024-11-17 04:30:18,029 INFO L226 Difference]: Without dead ends: 125 [2024-11-17 04:30:18,030 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 04:30:18,030 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 11 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 04:30:18,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 327 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 04:30:18,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-17 04:30:18,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2024-11-17 04:30:18,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 82 states have (on average 1.4878048780487805) internal successors, (122), 119 states have internal predecessors, (122), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 04:30:18,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 128 transitions. [2024-11-17 04:30:18,043 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 128 transitions. Word has length 30 [2024-11-17 04:30:18,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:30:18,044 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 128 transitions. [2024-11-17 04:30:18,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 04:30:18,044 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 128 transitions. [2024-11-17 04:30:18,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-17 04:30:18,045 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:30:18,046 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 04:30:18,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-17 04:30:18,046 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2024-11-17 04:30:18,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:30:18,046 INFO L85 PathProgramCache]: Analyzing trace with hash 334761256, now seen corresponding path program 1 times [2024-11-17 04:30:18,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:30:18,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476600564] [2024-11-17 04:30:18,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:30:18,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:30:18,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:30:18,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-17 04:30:18,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:30:18,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-17 04:30:18,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:30:18,207 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-17 04:30:18,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:30:18,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476600564] [2024-11-17 04:30:18,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476600564] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 04:30:18,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 04:30:18,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 04:30:18,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725532369] [2024-11-17 04:30:18,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 04:30:18,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 04:30:18,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:30:18,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 04:30:18,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 04:30:18,212 INFO L87 Difference]: Start difference. First operand 125 states and 128 transitions. Second operand has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 04:30:18,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:30:18,255 INFO L93 Difference]: Finished difference Result 127 states and 130 transitions. [2024-11-17 04:30:18,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 04:30:18,255 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 34 [2024-11-17 04:30:18,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:30:18,256 INFO L225 Difference]: With dead ends: 127 [2024-11-17 04:30:18,257 INFO L226 Difference]: Without dead ends: 126 [2024-11-17 04:30:18,257 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 04:30:18,258 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 37 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 04:30:18,259 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 170 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 04:30:18,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-17 04:30:18,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2024-11-17 04:30:18,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 83 states have (on average 1.4819277108433735) internal successors, (123), 120 states have internal predecessors, (123), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 04:30:18,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 129 transitions. [2024-11-17 04:30:18,270 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 129 transitions. Word has length 34 [2024-11-17 04:30:18,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:30:18,271 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 129 transitions. [2024-11-17 04:30:18,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 04:30:18,271 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 129 transitions. [2024-11-17 04:30:18,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-17 04:30:18,271 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:30:18,272 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 04:30:18,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-17 04:30:18,272 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2024-11-17 04:30:18,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:30:18,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1787664407, now seen corresponding path program 1 times [2024-11-17 04:30:18,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:30:18,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297401153] [2024-11-17 04:30:18,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:30:18,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:30:18,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:30:18,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-17 04:30:18,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:30:18,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-17 04:30:18,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:30:18,338 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-17 04:30:18,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:30:18,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297401153] [2024-11-17 04:30:18,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297401153] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 04:30:18,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 04:30:18,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 04:30:18,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245836553] [2024-11-17 04:30:18,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 04:30:18,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 04:30:18,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:30:18,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 04:30:18,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 04:30:18,343 INFO L87 Difference]: Start difference. First operand 126 states and 129 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 04:30:18,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:30:18,429 INFO L93 Difference]: Finished difference Result 128 states and 131 transitions. [2024-11-17 04:30:18,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 04:30:18,429 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2024-11-17 04:30:18,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:30:18,430 INFO L225 Difference]: With dead ends: 128 [2024-11-17 04:30:18,431 INFO L226 Difference]: Without dead ends: 127 [2024-11-17 04:30:18,431 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 04:30:18,432 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 48 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 04:30:18,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 226 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 04:30:18,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-17 04:30:18,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2024-11-17 04:30:18,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 84 states have (on average 1.4761904761904763) internal successors, (124), 121 states have internal predecessors, (124), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 04:30:18,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 130 transitions. [2024-11-17 04:30:18,444 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 130 transitions. Word has length 35 [2024-11-17 04:30:18,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:30:18,444 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 130 transitions. [2024-11-17 04:30:18,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 04:30:18,445 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 130 transitions. [2024-11-17 04:30:18,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-17 04:30:18,445 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:30:18,445 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 04:30:18,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-17 04:30:18,446 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2024-11-17 04:30:18,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:30:18,446 INFO L85 PathProgramCache]: Analyzing trace with hash -416978170, now seen corresponding path program 1 times [2024-11-17 04:30:18,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:30:18,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513265984] [2024-11-17 04:30:18,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:30:18,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:30:18,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-17 04:30:18,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1805671106] [2024-11-17 04:30:18,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:30:18,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 04:30:18,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 04:30:18,469 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 04:30:18,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-17 04:30:18,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:30:18,513 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 04:30:18,514 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 04:30:18,575 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-17 04:30:18,575 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 04:30:18,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:30:18,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513265984] [2024-11-17 04:30:18,575 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-17 04:30:18,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1805671106] [2024-11-17 04:30:18,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1805671106] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 04:30:18,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 04:30:18,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 04:30:18,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81999556] [2024-11-17 04:30:18,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 04:30:18,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 04:30:18,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:30:18,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 04:30:18,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 04:30:18,577 INFO L87 Difference]: Start difference. First operand 127 states and 130 transitions. Second operand has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 04:30:18,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:30:18,641 INFO L93 Difference]: Finished difference Result 165 states and 176 transitions. [2024-11-17 04:30:18,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 04:30:18,641 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2024-11-17 04:30:18,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:30:18,643 INFO L225 Difference]: With dead ends: 165 [2024-11-17 04:30:18,643 INFO L226 Difference]: Without dead ends: 164 [2024-11-17 04:30:18,643 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 04:30:18,644 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 35 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 04:30:18,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 199 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 04:30:18,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-11-17 04:30:18,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 128. [2024-11-17 04:30:18,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 85 states have (on average 1.4705882352941178) internal successors, (125), 122 states have internal predecessors, (125), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 04:30:18,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 131 transitions. [2024-11-17 04:30:18,652 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 131 transitions. Word has length 36 [2024-11-17 04:30:18,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:30:18,652 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 131 transitions. [2024-11-17 04:30:18,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 04:30:18,653 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 131 transitions. [2024-11-17 04:30:18,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-17 04:30:18,653 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:30:18,653 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 04:30:18,670 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-17 04:30:18,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 04:30:18,856 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2024-11-17 04:30:18,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:30:18,857 INFO L85 PathProgramCache]: Analyzing trace with hash -41421323, now seen corresponding path program 1 times [2024-11-17 04:30:18,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:30:18,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328950500] [2024-11-17 04:30:18,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:30:18,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:30:18,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:30:18,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-17 04:30:18,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:30:19,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-17 04:30:19,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:30:19,036 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-17 04:30:19,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:30:19,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328950500] [2024-11-17 04:30:19,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328950500] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 04:30:19,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1854752366] [2024-11-17 04:30:19,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:30:19,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 04:30:19,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 04:30:19,040 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 04:30:19,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-17 04:30:19,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:30:19,086 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-17 04:30:19,087 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 04:30:19,359 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-17 04:30:19,359 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 04:30:19,553 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-17 04:30:19,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1854752366] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 04:30:19,554 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 04:30:19,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-11-17 04:30:19,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042445084] [2024-11-17 04:30:19,554 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 04:30:19,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-17 04:30:19,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:30:19,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-17 04:30:19,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2024-11-17 04:30:19,556 INFO L87 Difference]: Start difference. First operand 128 states and 131 transitions. Second operand has 14 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-17 04:30:19,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:30:19,795 INFO L93 Difference]: Finished difference Result 165 states and 175 transitions. [2024-11-17 04:30:19,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-17 04:30:19,795 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 6 states have call successors, (6) Word has length 37 [2024-11-17 04:30:19,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:30:19,796 INFO L225 Difference]: With dead ends: 165 [2024-11-17 04:30:19,796 INFO L226 Difference]: Without dead ends: 164 [2024-11-17 04:30:19,797 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2024-11-17 04:30:19,797 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 231 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 04:30:19,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 522 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 04:30:19,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-11-17 04:30:19,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 129. [2024-11-17 04:30:19,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 86 states have (on average 1.4651162790697674) internal successors, (126), 123 states have internal predecessors, (126), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 04:30:19,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 132 transitions. [2024-11-17 04:30:19,804 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 132 transitions. Word has length 37 [2024-11-17 04:30:19,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:30:19,804 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 132 transitions. [2024-11-17 04:30:19,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-17 04:30:19,805 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 132 transitions. [2024-11-17 04:30:19,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-17 04:30:19,805 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:30:19,805 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 04:30:19,821 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-17 04:30:20,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-17 04:30:20,006 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2024-11-17 04:30:20,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:30:20,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1151183917, now seen corresponding path program 1 times [2024-11-17 04:30:20,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:30:20,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053764194] [2024-11-17 04:30:20,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:30:20,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:30:20,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-17 04:30:20,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1710350643] [2024-11-17 04:30:20,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:30:20,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 04:30:20,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 04:30:20,021 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 04:30:20,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-17 04:30:20,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:30:20,064 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-17 04:30:20,065 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 04:30:20,239 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-17 04:30:20,239 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 04:30:20,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:30:20,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053764194] [2024-11-17 04:30:20,359 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-17 04:30:20,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1710350643] [2024-11-17 04:30:20,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1710350643] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 04:30:20,360 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-17 04:30:20,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2024-11-17 04:30:20,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016452131] [2024-11-17 04:30:20,360 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-17 04:30:20,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 04:30:20,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:30:20,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 04:30:20,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-17 04:30:20,361 INFO L87 Difference]: Start difference. First operand 129 states and 132 transitions. Second operand has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 04:30:21,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:30:21,546 INFO L93 Difference]: Finished difference Result 213 states and 227 transitions. [2024-11-17 04:30:21,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-17 04:30:21,546 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 39 [2024-11-17 04:30:21,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:30:21,547 INFO L225 Difference]: With dead ends: 213 [2024-11-17 04:30:21,549 INFO L226 Difference]: Without dead ends: 198 [2024-11-17 04:30:21,549 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-11-17 04:30:21,550 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 239 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-17 04:30:21,551 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 315 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-17 04:30:21,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-11-17 04:30:21,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 181. [2024-11-17 04:30:21,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 137 states have (on average 1.4817518248175183) internal successors, (203), 174 states have internal predecessors, (203), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-17 04:30:21,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 211 transitions. [2024-11-17 04:30:21,561 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 211 transitions. Word has length 39 [2024-11-17 04:30:21,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:30:21,562 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 211 transitions. [2024-11-17 04:30:21,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 04:30:21,562 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 211 transitions. [2024-11-17 04:30:21,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-17 04:30:21,563 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:30:21,563 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 04:30:21,580 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-17 04:30:21,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 04:30:21,764 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2024-11-17 04:30:21,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:30:21,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1813819825, now seen corresponding path program 1 times [2024-11-17 04:30:21,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:30:21,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522502998] [2024-11-17 04:30:21,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:30:21,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:30:21,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-17 04:30:21,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1653367410] [2024-11-17 04:30:21,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:30:21,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 04:30:21,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 04:30:21,789 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 04:30:21,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-17 04:30:21,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:30:21,830 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 04:30:21,831 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 04:30:21,859 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-17 04:30:21,859 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 04:30:21,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:30:21,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522502998] [2024-11-17 04:30:21,860 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-17 04:30:21,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1653367410] [2024-11-17 04:30:21,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1653367410] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 04:30:21,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 04:30:21,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 04:30:21,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340775671] [2024-11-17 04:30:21,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 04:30:21,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 04:30:21,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:30:21,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 04:30:21,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 04:30:21,862 INFO L87 Difference]: Start difference. First operand 181 states and 211 transitions. Second operand has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 04:30:21,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:30:21,966 INFO L93 Difference]: Finished difference Result 308 states and 369 transitions. [2024-11-17 04:30:21,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 04:30:21,968 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 41 [2024-11-17 04:30:21,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:30:21,969 INFO L225 Difference]: With dead ends: 308 [2024-11-17 04:30:21,969 INFO L226 Difference]: Without dead ends: 279 [2024-11-17 04:30:21,970 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 04:30:21,970 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 58 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 04:30:21,970 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 166 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 04:30:21,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2024-11-17 04:30:21,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 260. [2024-11-17 04:30:21,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 214 states have (on average 1.4532710280373833) internal successors, (311), 251 states have internal predecessors, (311), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-17 04:30:21,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 323 transitions. [2024-11-17 04:30:21,986 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 323 transitions. Word has length 41 [2024-11-17 04:30:21,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:30:21,986 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 323 transitions. [2024-11-17 04:30:21,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 04:30:21,987 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 323 transitions. [2024-11-17 04:30:21,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-17 04:30:21,989 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:30:21,989 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 04:30:22,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-17 04:30:22,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 04:30:22,190 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2024-11-17 04:30:22,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:30:22,191 INFO L85 PathProgramCache]: Analyzing trace with hash 128865850, now seen corresponding path program 1 times [2024-11-17 04:30:22,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:30:22,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956692141] [2024-11-17 04:30:22,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:30:22,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:30:22,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:30:22,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-17 04:30:22,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:30:22,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-17 04:30:22,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:30:22,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-17 04:30:22,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:30:22,255 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-17 04:30:22,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:30:22,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956692141] [2024-11-17 04:30:22,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956692141] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 04:30:22,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 04:30:22,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 04:30:22,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150440378] [2024-11-17 04:30:22,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 04:30:22,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 04:30:22,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:30:22,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 04:30:22,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-17 04:30:22,258 INFO L87 Difference]: Start difference. First operand 260 states and 323 transitions. Second operand has 4 states, 3 states have (on average 16.666666666666668) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 04:30:22,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:30:22,414 INFO L93 Difference]: Finished difference Result 280 states and 326 transitions. [2024-11-17 04:30:22,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 04:30:22,414 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 16.666666666666668) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 59 [2024-11-17 04:30:22,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:30:22,416 INFO L225 Difference]: With dead ends: 280 [2024-11-17 04:30:22,417 INFO L226 Difference]: Without dead ends: 279 [2024-11-17 04:30:22,417 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-17 04:30:22,418 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 45 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 04:30:22,418 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 246 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 04:30:22,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2024-11-17 04:30:22,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 260. [2024-11-17 04:30:22,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 214 states have (on average 1.4439252336448598) internal successors, (309), 251 states have internal predecessors, (309), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-17 04:30:22,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 321 transitions. [2024-11-17 04:30:22,442 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 321 transitions. Word has length 59 [2024-11-17 04:30:22,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:30:22,443 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 321 transitions. [2024-11-17 04:30:22,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 16.666666666666668) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 04:30:22,443 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 321 transitions. [2024-11-17 04:30:22,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-17 04:30:22,446 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:30:22,447 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 04:30:22,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-17 04:30:22,447 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2024-11-17 04:30:22,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:30:22,448 INFO L85 PathProgramCache]: Analyzing trace with hash 128865891, now seen corresponding path program 1 times [2024-11-17 04:30:22,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:30:22,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608686337] [2024-11-17 04:30:22,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:30:22,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:30:22,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:30:22,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-17 04:30:22,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:30:22,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-17 04:30:22,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:30:22,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-17 04:30:22,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:30:22,553 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-17 04:30:22,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:30:22,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608686337] [2024-11-17 04:30:22,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608686337] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 04:30:22,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 04:30:22,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 04:30:22,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453516923] [2024-11-17 04:30:22,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 04:30:22,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 04:30:22,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:30:22,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 04:30:22,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 04:30:22,557 INFO L87 Difference]: Start difference. First operand 260 states and 321 transitions. Second operand has 5 states, 4 states have (on average 12.5) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 04:30:22,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:30:22,694 INFO L93 Difference]: Finished difference Result 260 states and 321 transitions. [2024-11-17 04:30:22,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 04:30:22,695 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 12.5) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 59 [2024-11-17 04:30:22,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:30:22,696 INFO L225 Difference]: With dead ends: 260 [2024-11-17 04:30:22,696 INFO L226 Difference]: Without dead ends: 259 [2024-11-17 04:30:22,696 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-17 04:30:22,697 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 128 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 04:30:22,697 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 202 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 04:30:22,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2024-11-17 04:30:22,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2024-11-17 04:30:22,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 214 states have (on average 1.425233644859813) internal successors, (305), 250 states have internal predecessors, (305), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-17 04:30:22,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 317 transitions. [2024-11-17 04:30:22,709 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 317 transitions. Word has length 59 [2024-11-17 04:30:22,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:30:22,709 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 317 transitions. [2024-11-17 04:30:22,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 12.5) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 04:30:22,709 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 317 transitions. [2024-11-17 04:30:22,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-17 04:30:22,711 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:30:22,711 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 04:30:22,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-17 04:30:22,711 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2024-11-17 04:30:22,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:30:22,712 INFO L85 PathProgramCache]: Analyzing trace with hash -300125934, now seen corresponding path program 1 times [2024-11-17 04:30:22,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:30:22,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432836645] [2024-11-17 04:30:22,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:30:22,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:30:22,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:30:22,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-17 04:30:22,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:30:22,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-17 04:30:22,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:30:22,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-17 04:30:22,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:30:22,811 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-17 04:30:22,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:30:22,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432836645] [2024-11-17 04:30:22,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432836645] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 04:30:22,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 04:30:22,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 04:30:22,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272564397] [2024-11-17 04:30:22,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 04:30:22,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 04:30:22,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:30:22,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 04:30:22,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-17 04:30:22,813 INFO L87 Difference]: Start difference. First operand 259 states and 317 transitions. Second operand has 5 states, 4 states have (on average 12.75) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 04:30:23,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:30:23,008 INFO L93 Difference]: Finished difference Result 274 states and 320 transitions. [2024-11-17 04:30:23,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 04:30:23,008 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 12.75) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 60 [2024-11-17 04:30:23,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:30:23,009 INFO L225 Difference]: With dead ends: 274 [2024-11-17 04:30:23,009 INFO L226 Difference]: Without dead ends: 273 [2024-11-17 04:30:23,010 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 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-11-17 04:30:23,010 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 200 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 04:30:23,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 200 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 04:30:23,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2024-11-17 04:30:23,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 259. [2024-11-17 04:30:23,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 214 states have (on average 1.4158878504672898) internal successors, (303), 250 states have internal predecessors, (303), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-17 04:30:23,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 315 transitions. [2024-11-17 04:30:23,021 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 315 transitions. Word has length 60 [2024-11-17 04:30:23,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:30:23,022 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 315 transitions. [2024-11-17 04:30:23,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 12.75) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 04:30:23,022 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 315 transitions. [2024-11-17 04:30:23,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-17 04:30:23,022 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:30:23,023 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 04:30:23,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-17 04:30:23,023 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2024-11-17 04:30:23,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:30:23,023 INFO L85 PathProgramCache]: Analyzing trace with hash -300124653, now seen corresponding path program 1 times [2024-11-17 04:30:23,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:30:23,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650393553] [2024-11-17 04:30:23,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:30:23,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:30:23,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:30:23,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-17 04:30:23,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:30:23,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-17 04:30:23,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:30:23,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-17 04:30:23,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:30:23,081 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-17 04:30:23,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:30:23,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650393553] [2024-11-17 04:30:23,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650393553] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 04:30:23,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 04:30:23,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 04:30:23,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789558832] [2024-11-17 04:30:23,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 04:30:23,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 04:30:23,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:30:23,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 04:30:23,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 04:30:23,084 INFO L87 Difference]: Start difference. First operand 259 states and 315 transitions. Second operand has 4 states, 3 states have (on average 17.0) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 04:30:23,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:30:23,220 INFO L93 Difference]: Finished difference Result 284 states and 344 transitions. [2024-11-17 04:30:23,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 04:30:23,221 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 17.0) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 60 [2024-11-17 04:30:23,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:30:23,222 INFO L225 Difference]: With dead ends: 284 [2024-11-17 04:30:23,222 INFO L226 Difference]: Without dead ends: 280 [2024-11-17 04:30:23,223 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 04:30:23,223 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 62 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 04:30:23,223 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 194 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 04:30:23,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2024-11-17 04:30:23,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 253. [2024-11-17 04:30:23,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 212 states have (on average 1.3726415094339623) internal successors, (291), 244 states have internal predecessors, (291), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-17 04:30:23,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 303 transitions. [2024-11-17 04:30:23,234 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 303 transitions. Word has length 60 [2024-11-17 04:30:23,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:30:23,235 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 303 transitions. [2024-11-17 04:30:23,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 17.0) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 04:30:23,235 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 303 transitions. [2024-11-17 04:30:23,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-17 04:30:23,236 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:30:23,236 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-17 04:30:23,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-17 04:30:23,236 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2024-11-17 04:30:23,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:30:23,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1421560909, now seen corresponding path program 1 times [2024-11-17 04:30:23,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:30:23,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131111100] [2024-11-17 04:30:23,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:30:23,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:30:23,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:30:23,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-17 04:30:23,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:30:23,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-17 04:30:23,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:30:23,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-17 04:30:23,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:30:23,324 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-17 04:30:23,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:30:23,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131111100] [2024-11-17 04:30:23,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131111100] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 04:30:23,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1320746067] [2024-11-17 04:30:23,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:30:23,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 04:30:23,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 04:30:23,327 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 04:30:23,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-17 04:30:23,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:30:23,385 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 04:30:23,387 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 04:30:23,471 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-17 04:30:23,472 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 04:30:23,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1320746067] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 04:30:23,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-17 04:30:23,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2024-11-17 04:30:23,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251023479] [2024-11-17 04:30:23,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 04:30:23,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 04:30:23,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:30:23,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 04:30:23,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-17 04:30:23,473 INFO L87 Difference]: Start difference. First operand 253 states and 303 transitions. Second operand has 6 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 04:30:23,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:30:23,527 INFO L93 Difference]: Finished difference Result 253 states and 303 transitions. [2024-11-17 04:30:23,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 04:30:23,527 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 66 [2024-11-17 04:30:23,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:30:23,529 INFO L225 Difference]: With dead ends: 253 [2024-11-17 04:30:23,529 INFO L226 Difference]: Without dead ends: 252 [2024-11-17 04:30:23,529 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2024-11-17 04:30:23,530 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 66 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 04:30:23,530 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 348 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 04:30:23,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2024-11-17 04:30:23,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 252. [2024-11-17 04:30:23,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 212 states have (on average 1.3584905660377358) internal successors, (288), 243 states have internal predecessors, (288), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-17 04:30:23,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 300 transitions. [2024-11-17 04:30:23,542 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 300 transitions. Word has length 66 [2024-11-17 04:30:23,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:30:23,542 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 300 transitions. [2024-11-17 04:30:23,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 04:30:23,542 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 300 transitions. [2024-11-17 04:30:23,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-17 04:30:23,543 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:30:23,543 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 04:30:23,561 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-17 04:30:23,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-17 04:30:23,744 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2024-11-17 04:30:23,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:30:23,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1118715289, now seen corresponding path program 1 times [2024-11-17 04:30:23,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:30:23,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84243532] [2024-11-17 04:30:23,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:30:23,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:30:23,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:30:23,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-17 04:30:23,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:30:23,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-17 04:30:23,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:30:23,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-17 04:30:23,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:30:23,828 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-17 04:30:23,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:30:23,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84243532] [2024-11-17 04:30:23,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84243532] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 04:30:23,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1823121973] [2024-11-17 04:30:23,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:30:23,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 04:30:23,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 04:30:23,831 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 04:30:23,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-17 04:30:23,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:30:23,877 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 04:30:23,879 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 04:30:23,958 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-17 04:30:23,958 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 04:30:24,052 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-17 04:30:24,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1823121973] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 04:30:24,052 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 04:30:24,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 5] total 12 [2024-11-17 04:30:24,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200424762] [2024-11-17 04:30:24,053 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 04:30:24,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-17 04:30:24,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:30:24,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-17 04:30:24,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2024-11-17 04:30:24,054 INFO L87 Difference]: Start difference. First operand 252 states and 300 transitions. Second operand has 13 states, 12 states have (on average 11.583333333333334) internal successors, (139), 13 states have internal predecessors, (139), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2024-11-17 04:30:24,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:30:24,177 INFO L93 Difference]: Finished difference Result 648 states and 752 transitions. [2024-11-17 04:30:24,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-17 04:30:24,178 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 11.583333333333334) internal successors, (139), 13 states have internal predecessors, (139), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 67 [2024-11-17 04:30:24,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:30:24,180 INFO L225 Difference]: With dead ends: 648 [2024-11-17 04:30:24,180 INFO L226 Difference]: Without dead ends: 605 [2024-11-17 04:30:24,181 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=228, Unknown=0, NotChecked=0, Total=342 [2024-11-17 04:30:24,181 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 250 mSDsluCounter, 774 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 04:30:24,182 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 885 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 04:30:24,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2024-11-17 04:30:24,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 463. [2024-11-17 04:30:24,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 415 states have (on average 1.378313253012048) internal successors, (572), 446 states have internal predecessors, (572), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-17 04:30:24,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 594 transitions. [2024-11-17 04:30:24,203 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 594 transitions. Word has length 67 [2024-11-17 04:30:24,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:30:24,203 INFO L471 AbstractCegarLoop]: Abstraction has 463 states and 594 transitions. [2024-11-17 04:30:24,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 11.583333333333334) internal successors, (139), 13 states have internal predecessors, (139), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2024-11-17 04:30:24,203 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 594 transitions. [2024-11-17 04:30:24,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-17 04:30:24,204 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:30:24,204 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 04:30:24,220 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-17 04:30:24,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-17 04:30:24,409 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2024-11-17 04:30:24,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:30:24,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1298973879, now seen corresponding path program 1 times [2024-11-17 04:30:24,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:30:24,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991277139] [2024-11-17 04:30:24,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:30:24,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:30:24,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:30:24,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-17 04:30:24,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:30:24,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-17 04:30:24,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:30:24,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-17 04:30:24,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:30:24,520 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-17 04:30:24,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:30:24,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991277139] [2024-11-17 04:30:24,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991277139] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 04:30:24,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1278985441] [2024-11-17 04:30:24,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:30:24,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 04:30:24,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 04:30:24,522 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 04:30:24,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-17 04:30:24,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:30:24,570 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 04:30:24,572 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 04:30:24,757 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-17 04:30:24,757 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 04:30:24,883 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-17 04:30:24,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1278985441] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 04:30:24,883 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 04:30:24,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 13 [2024-11-17 04:30:24,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172733004] [2024-11-17 04:30:24,886 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 04:30:24,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-17 04:30:24,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:30:24,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-17 04:30:24,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2024-11-17 04:30:24,887 INFO L87 Difference]: Start difference. First operand 463 states and 594 transitions. Second operand has 14 states, 13 states have (on average 12.153846153846153) internal successors, (158), 14 states have internal predecessors, (158), 5 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-17 04:30:25,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:30:25,534 INFO L93 Difference]: Finished difference Result 634 states and 793 transitions. [2024-11-17 04:30:25,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-17 04:30:25,534 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 12.153846153846153) internal successors, (158), 14 states have internal predecessors, (158), 5 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 70 [2024-11-17 04:30:25,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:30:25,537 INFO L225 Difference]: With dead ends: 634 [2024-11-17 04:30:25,537 INFO L226 Difference]: Without dead ends: 632 [2024-11-17 04:30:25,538 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=335, Unknown=0, NotChecked=0, Total=506 [2024-11-17 04:30:25,538 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 625 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 621 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 625 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-17 04:30:25,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [625 Valid, 392 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 621 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-17 04:30:25,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2024-11-17 04:30:25,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 493. [2024-11-17 04:30:25,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 445 states have (on average 1.3595505617977528) internal successors, (605), 476 states have internal predecessors, (605), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-17 04:30:25,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 627 transitions. [2024-11-17 04:30:25,564 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 627 transitions. Word has length 70 [2024-11-17 04:30:25,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:30:25,564 INFO L471 AbstractCegarLoop]: Abstraction has 493 states and 627 transitions. [2024-11-17 04:30:25,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 12.153846153846153) internal successors, (158), 14 states have internal predecessors, (158), 5 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-17 04:30:25,564 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 627 transitions. [2024-11-17 04:30:25,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-17 04:30:25,565 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:30:25,565 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 04:30:25,581 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-17 04:30:25,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 04:30:25,766 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2024-11-17 04:30:25,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:30:25,767 INFO L85 PathProgramCache]: Analyzing trace with hash 877299082, now seen corresponding path program 1 times [2024-11-17 04:30:25,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:30:25,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240858520] [2024-11-17 04:30:25,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:30:25,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:30:25,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:30:25,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-17 04:30:25,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:30:25,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-17 04:30:25,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:30:25,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-17 04:30:25,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:30:25,835 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-17 04:30:25,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:30:25,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240858520] [2024-11-17 04:30:25,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240858520] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 04:30:25,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 04:30:25,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 04:30:25,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135798525] [2024-11-17 04:30:25,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 04:30:25,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 04:30:25,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:30:25,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 04:30:25,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-17 04:30:25,838 INFO L87 Difference]: Start difference. First operand 493 states and 627 transitions. Second operand has 5 states, 4 states have (on average 15.25) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 04:30:26,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:30:26,013 INFO L93 Difference]: Finished difference Result 538 states and 676 transitions. [2024-11-17 04:30:26,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 04:30:26,014 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.25) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 70 [2024-11-17 04:30:26,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:30:26,016 INFO L225 Difference]: With dead ends: 538 [2024-11-17 04:30:26,016 INFO L226 Difference]: Without dead ends: 537 [2024-11-17 04:30:26,017 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-17 04:30:26,017 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 102 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 04:30:26,018 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 257 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 04:30:26,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2024-11-17 04:30:26,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 483. [2024-11-17 04:30:26,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 436 states have (on average 1.3509174311926606) internal successors, (589), 466 states have internal predecessors, (589), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-17 04:30:26,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 611 transitions. [2024-11-17 04:30:26,044 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 611 transitions. Word has length 70 [2024-11-17 04:30:26,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:30:26,044 INFO L471 AbstractCegarLoop]: Abstraction has 483 states and 611 transitions. [2024-11-17 04:30:26,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.25) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 04:30:26,044 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 611 transitions. [2024-11-17 04:30:26,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-17 04:30:26,045 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:30:26,045 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 04:30:26,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-17 04:30:26,045 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2024-11-17 04:30:26,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:30:26,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1613484522, now seen corresponding path program 1 times [2024-11-17 04:30:26,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:30:26,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768802129] [2024-11-17 04:30:26,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:30:26,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:30:26,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:30:26,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-17 04:30:26,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:30:26,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-17 04:30:26,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:30:26,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-17 04:30:26,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:30:26,124 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-17 04:30:26,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:30:26,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768802129] [2024-11-17 04:30:26,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768802129] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 04:30:26,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1590524542] [2024-11-17 04:30:26,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:30:26,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 04:30:26,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 04:30:26,126 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 04:30:26,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-17 04:30:26,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:30:26,171 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 04:30:26,172 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 04:30:41,502 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~R~0#1_46| Int)) (let ((.cse0 (* |v_ULTIMATE.start_main_~R~0#1_46| |v_ULTIMATE.start_main_~R~0#1_46|))) (and (<= (+ |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~A~0#1| 1) .cse0) (<= .cse0 9223372036854775807)))) is different from true [2024-11-17 04:30:41,557 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 7 not checked. [2024-11-17 04:30:41,557 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 04:30:41,688 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-17 04:30:41,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1590524542] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 04:30:41,689 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 04:30:41,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2024-11-17 04:30:41,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839609930] [2024-11-17 04:30:41,689 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 04:30:41,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-17 04:30:41,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:30:41,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-17 04:30:41,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=106, Unknown=6, NotChecked=22, Total=182 [2024-11-17 04:30:41,691 INFO L87 Difference]: Start difference. First operand 483 states and 611 transitions. Second operand has 14 states, 13 states have (on average 11.538461538461538) internal successors, (150), 14 states have internal predecessors, (150), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-17 04:30:45,715 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-11-17 04:30:49,727 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-17 04:30:52,912 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-17 04:30:57,089 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-11-17 04:30:58,099 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-17 04:31:00,150 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-11-17 04:31:01,164 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-17 04:31:05,167 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-11-17 04:31:07,186 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-11-17 04:31:11,194 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-17 04:31:15,201 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-11-17 04:31:24,193 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-11-17 04:31:29,207 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-17 04:31:30,431 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-17 04:31:31,460 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-17 04:31:35,466 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-17 04:31:36,799 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-17 04:31:40,807 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-11-17 04:31:44,816 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-11-17 04:31:48,835 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-11-17 04:31:52,848 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-11-17 04:31:53,895 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]