./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound100.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 023d838f 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/ps6-ll_valuebound100.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b8588da8d66d82eb7aa3eaf3ef7c4d24b2b275bf9c1acdf38a110c8bc6eba3b7 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 19:34:18,793 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 19:34:18,861 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-10 19:34:18,868 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 19:34:18,869 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 19:34:18,892 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 19:34:18,893 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 19:34:18,893 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 19:34:18,895 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 19:34:18,898 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 19:34:18,899 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 19:34:18,899 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 19:34:18,900 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 19:34:18,900 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 19:34:18,900 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 19:34:18,900 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 19:34:18,901 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 19:34:18,901 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 19:34:18,901 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 19:34:18,903 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 19:34:18,903 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 19:34:18,903 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 19:34:18,904 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 19:34:18,904 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 19:34:18,904 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 19:34:18,914 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-10 19:34:18,914 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 19:34:18,915 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 19:34:18,915 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 19:34:18,915 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 19:34:18,916 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 19:34:18,916 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 19:34:18,917 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 19:34:18,917 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 19:34:18,917 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 19:34:18,918 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 19:34:18,918 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 19:34:18,918 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 19:34:18,918 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 19:34:18,919 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 19:34:18,919 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 19:34:18,920 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 19:34:18,920 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 19:34:18,920 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 19:34:18,920 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 -> b8588da8d66d82eb7aa3eaf3ef7c4d24b2b275bf9c1acdf38a110c8bc6eba3b7 [2024-11-10 19:34:19,190 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 19:34:19,215 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 19:34:19,217 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 19:34:19,218 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 19:34:19,218 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 19:34:19,219 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound100.c [2024-11-10 19:34:20,647 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 19:34:20,881 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 19:34:20,882 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound100.c [2024-11-10 19:34:20,892 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abb04fc58/c4922a3769d8482dbbbf3e8a057f4337/FLAGbb5bd23b5 [2024-11-10 19:34:21,233 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abb04fc58/c4922a3769d8482dbbbf3e8a057f4337 [2024-11-10 19:34:21,238 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 19:34:21,239 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 19:34:21,242 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 19:34:21,242 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 19:34:21,247 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 19:34:21,248 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:34:21" (1/1) ... [2024-11-10 19:34:21,249 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@609bcab0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:34:21, skipping insertion in model container [2024-11-10 19:34:21,249 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:34:21" (1/1) ... [2024-11-10 19:34:21,269 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 19:34:21,445 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 19:34:21,455 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 19:34:21,477 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 19:34:21,491 INFO L204 MainTranslator]: Completed translation [2024-11-10 19:34:21,491 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:34:21 WrapperNode [2024-11-10 19:34:21,491 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 19:34:21,492 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 19:34:21,492 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 19:34:21,492 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 19:34:21,499 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:34:21" (1/1) ... [2024-11-10 19:34:21,509 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:34:21" (1/1) ... [2024-11-10 19:34:21,539 INFO L138 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 143 [2024-11-10 19:34:21,540 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 19:34:21,540 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 19:34:21,540 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 19:34:21,541 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 19:34:21,552 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:34:21" (1/1) ... [2024-11-10 19:34:21,552 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:34:21" (1/1) ... [2024-11-10 19:34:21,554 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:34:21" (1/1) ... [2024-11-10 19:34:21,571 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-10 19:34:21,572 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:34:21" (1/1) ... [2024-11-10 19:34:21,572 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:34:21" (1/1) ... [2024-11-10 19:34:21,580 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:34:21" (1/1) ... [2024-11-10 19:34:21,580 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:34:21" (1/1) ... [2024-11-10 19:34:21,586 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:34:21" (1/1) ... [2024-11-10 19:34:21,587 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:34:21" (1/1) ... [2024-11-10 19:34:21,592 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 19:34:21,596 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 19:34:21,596 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 19:34:21,596 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 19:34:21,597 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:34:21" (1/1) ... [2024-11-10 19:34:21,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 19:34:21,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:34:21,632 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-10 19:34:21,634 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-10 19:34:21,683 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 19:34:21,683 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 19:34:21,683 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 19:34:21,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 19:34:21,684 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 19:34:21,684 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 19:34:21,684 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-10 19:34:21,684 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-10 19:34:21,747 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 19:34:21,751 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 19:34:22,359 INFO L? ?]: Removed 91 outVars from TransFormulas that were not future-live. [2024-11-10 19:34:22,360 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 19:34:22,380 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 19:34:22,381 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 19:34:22,381 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:34:22 BoogieIcfgContainer [2024-11-10 19:34:22,381 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 19:34:22,384 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 19:34:22,385 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 19:34:22,388 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 19:34:22,389 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:34:21" (1/3) ... [2024-11-10 19:34:22,390 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c2bca06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:34:22, skipping insertion in model container [2024-11-10 19:34:22,390 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:34:21" (2/3) ... [2024-11-10 19:34:22,391 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c2bca06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:34:22, skipping insertion in model container [2024-11-10 19:34:22,391 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:34:22" (3/3) ... [2024-11-10 19:34:22,392 INFO L112 eAbstractionObserver]: Analyzing ICFG ps6-ll_valuebound100.c [2024-11-10 19:34:22,408 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 19:34:22,408 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 102 error locations. [2024-11-10 19:34:22,478 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 19:34:22,484 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;@33a9da82, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 19:34:22,485 INFO L334 AbstractCegarLoop]: Starting to check reachability of 102 error locations. [2024-11-10 19:34:22,488 INFO L276 IsEmpty]: Start isEmpty. Operand has 232 states, 122 states have (on average 1.8770491803278688) internal successors, (229), 224 states have internal predecessors, (229), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-10 19:34:22,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-10 19:34:22,494 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:34:22,495 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:34:22,495 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2024-11-10 19:34:22,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:34:22,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1050880549, now seen corresponding path program 1 times [2024-11-10 19:34:22,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:34:22,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442844180] [2024-11-10 19:34:22,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:34:22,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:34:22,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:34:22,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 19:34:22,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:34:22,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-10 19:34:22,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:34:22,630 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-10 19:34:22,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:34:22,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442844180] [2024-11-10 19:34:22,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442844180] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:34:22,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:34:22,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 19:34:22,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652547042] [2024-11-10 19:34:22,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:34:22,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 19:34:22,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:34:22,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 19:34:22,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 19:34:22,660 INFO L87 Difference]: Start difference. First operand has 232 states, 122 states have (on average 1.8770491803278688) internal successors, (229), 224 states have internal predecessors, (229), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 19:34:22,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:34:22,719 INFO L93 Difference]: Finished difference Result 435 states and 478 transitions. [2024-11-10 19:34:22,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 19:34:22,725 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 15 [2024-11-10 19:34:22,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:34:22,732 INFO L225 Difference]: With dead ends: 435 [2024-11-10 19:34:22,732 INFO L226 Difference]: Without dead ends: 200 [2024-11-10 19:34:22,736 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 19:34:22,739 INFO L432 NwaCegarLoop]: 209 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 19:34:22,740 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 19:34:22,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-11-10 19:34:22,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2024-11-10 19:34:22,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 117 states have (on average 1.6581196581196582) internal successors, (194), 193 states have internal predecessors, (194), 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-10 19:34:22,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 202 transitions. [2024-11-10 19:34:22,800 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 202 transitions. Word has length 15 [2024-11-10 19:34:22,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:34:22,801 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 202 transitions. [2024-11-10 19:34:22,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 19:34:22,801 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 202 transitions. [2024-11-10 19:34:22,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-10 19:34:22,802 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:34:22,803 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:34:22,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 19:34:22,803 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr101ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2024-11-10 19:34:22,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:34:22,804 INFO L85 PathProgramCache]: Analyzing trace with hash -765851976, now seen corresponding path program 1 times [2024-11-10 19:34:22,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:34:22,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253087736] [2024-11-10 19:34:22,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:34:22,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:34:22,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:34:22,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 19:34:22,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:34:22,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-10 19:34:22,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:34:22,924 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-10 19:34:22,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:34:22,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253087736] [2024-11-10 19:34:22,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253087736] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:34:22,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:34:22,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 19:34:22,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684680870] [2024-11-10 19:34:22,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:34:22,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 19:34:22,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:34:22,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 19:34:22,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 19:34:22,932 INFO L87 Difference]: Start difference. First operand 200 states and 202 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (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-10 19:34:23,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:34:23,384 INFO L93 Difference]: Finished difference Result 364 states and 372 transitions. [2024-11-10 19:34:23,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 19:34:23,385 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 16 [2024-11-10 19:34:23,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:34:23,387 INFO L225 Difference]: With dead ends: 364 [2024-11-10 19:34:23,387 INFO L226 Difference]: Without dead ends: 300 [2024-11-10 19:34:23,390 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 19:34:23,391 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 100 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 19:34:23,392 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 144 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 19:34:23,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2024-11-10 19:34:23,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 293. [2024-11-10 19:34:23,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 209 states have (on average 1.4162679425837321) internal successors, (296), 285 states have internal predecessors, (296), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-10 19:34:23,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 306 transitions. [2024-11-10 19:34:23,411 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 306 transitions. Word has length 16 [2024-11-10 19:34:23,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:34:23,412 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 306 transitions. [2024-11-10 19:34:23,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (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-10 19:34:23,412 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 306 transitions. [2024-11-10 19:34:23,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-10 19:34:23,413 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:34:23,413 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] [2024-11-10 19:34:23,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 19:34:23,414 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr63ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2024-11-10 19:34:23,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:34:23,415 INFO L85 PathProgramCache]: Analyzing trace with hash 627825266, now seen corresponding path program 1 times [2024-11-10 19:34:23,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:34:23,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734364351] [2024-11-10 19:34:23,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:34:23,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:34:23,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:34:23,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 19:34:23,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:34:23,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-10 19:34:23,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:34:23,584 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-10 19:34:23,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:34:23,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734364351] [2024-11-10 19:34:23,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734364351] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:34:23,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:34:23,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 19:34:23,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150740501] [2024-11-10 19:34:23,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:34:23,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 19:34:23,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:34:23,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 19:34:23,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 19:34:23,587 INFO L87 Difference]: Start difference. First operand 293 states and 306 transitions. Second operand has 3 states, 2 states have (on average 23.5) internal successors, (47), 3 states have internal predecessors, (47), 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-10 19:34:23,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:34:23,661 INFO L93 Difference]: Finished difference Result 319 states and 326 transitions. [2024-11-10 19:34:23,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 19:34:23,661 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 23.5) internal successors, (47), 3 states have internal predecessors, (47), 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 54 [2024-11-10 19:34:23,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:34:23,663 INFO L225 Difference]: With dead ends: 319 [2024-11-10 19:34:23,665 INFO L226 Difference]: Without dead ends: 312 [2024-11-10 19:34:23,665 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 19:34:23,666 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 71 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:34:23,667 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 367 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:34:23,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2024-11-10 19:34:23,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 292. [2024-11-10 19:34:23,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 208 states have (on average 1.3894230769230769) internal successors, (289), 284 states have internal predecessors, (289), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-10 19:34:23,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 299 transitions. [2024-11-10 19:34:23,682 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 299 transitions. Word has length 54 [2024-11-10 19:34:23,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:34:23,683 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 299 transitions. [2024-11-10 19:34:23,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 23.5) internal successors, (47), 3 states have internal predecessors, (47), 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-10 19:34:23,683 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 299 transitions. [2024-11-10 19:34:23,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-10 19:34:23,684 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:34:23,685 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] [2024-11-10 19:34:23,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 19:34:23,685 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2024-11-10 19:34:23,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:34:23,686 INFO L85 PathProgramCache]: Analyzing trace with hash 2044662544, now seen corresponding path program 1 times [2024-11-10 19:34:23,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:34:23,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522574779] [2024-11-10 19:34:23,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:34:23,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:34:23,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:34:23,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 19:34:23,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:34:23,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-10 19:34:23,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:34:23,863 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-10 19:34:23,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:34:23,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522574779] [2024-11-10 19:34:23,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522574779] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:34:23,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:34:23,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 19:34:23,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076141640] [2024-11-10 19:34:23,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:34:23,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 19:34:23,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:34:23,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 19:34:23,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 19:34:23,865 INFO L87 Difference]: Start difference. First operand 292 states and 299 transitions. Second operand has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 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-10 19:34:24,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:34:24,330 INFO L93 Difference]: Finished difference Result 314 states and 319 transitions. [2024-11-10 19:34:24,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 19:34:24,331 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 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 56 [2024-11-10 19:34:24,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:34:24,333 INFO L225 Difference]: With dead ends: 314 [2024-11-10 19:34:24,333 INFO L226 Difference]: Without dead ends: 271 [2024-11-10 19:34:24,333 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 19:34:24,334 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 106 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 19:34:24,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 315 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 19:34:24,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2024-11-10 19:34:24,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 251. [2024-11-10 19:34:24,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 167 states have (on average 1.473053892215569) internal successors, (246), 243 states have internal predecessors, (246), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-10 19:34:24,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 256 transitions. [2024-11-10 19:34:24,345 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 256 transitions. Word has length 56 [2024-11-10 19:34:24,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:34:24,346 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 256 transitions. [2024-11-10 19:34:24,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 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-10 19:34:24,346 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 256 transitions. [2024-11-10 19:34:24,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-10 19:34:24,347 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:34:24,348 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, 1, 1, 1, 1] [2024-11-10 19:34:24,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 19:34:24,348 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2024-11-10 19:34:24,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:34:24,348 INFO L85 PathProgramCache]: Analyzing trace with hash 353781086, now seen corresponding path program 1 times [2024-11-10 19:34:24,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:34:24,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130067263] [2024-11-10 19:34:24,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:34:24,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:34:24,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:34:24,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 19:34:24,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:34:24,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-10 19:34:24,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:34:24,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 19:34:24,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:34:24,434 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-10 19:34:24,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:34:24,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130067263] [2024-11-10 19:34:24,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130067263] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:34:24,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:34:24,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 19:34:24,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216563422] [2024-11-10 19:34:24,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:34:24,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 19:34:24,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:34:24,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 19:34:24,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 19:34:24,440 INFO L87 Difference]: Start difference. First operand 251 states and 256 transitions. Second operand has 3 states, 2 states have (on average 27.5) internal successors, (55), 3 states have internal predecessors, (55), 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-10 19:34:24,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:34:24,460 INFO L93 Difference]: Finished difference Result 253 states and 256 transitions. [2024-11-10 19:34:24,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 19:34:24,463 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 27.5) internal successors, (55), 3 states have internal predecessors, (55), 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 64 [2024-11-10 19:34:24,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:34:24,465 INFO L225 Difference]: With dead ends: 253 [2024-11-10 19:34:24,465 INFO L226 Difference]: Without dead ends: 251 [2024-11-10 19:34:24,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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-10 19:34:24,466 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 2 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 19:34:24,467 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 391 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 19:34:24,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-11-10 19:34:24,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2024-11-10 19:34:24,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 167 states have (on average 1.4610778443113772) internal successors, (244), 243 states have internal predecessors, (244), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-10 19:34:24,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 254 transitions. [2024-11-10 19:34:24,476 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 254 transitions. Word has length 64 [2024-11-10 19:34:24,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:34:24,476 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 254 transitions. [2024-11-10 19:34:24,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 27.5) internal successors, (55), 3 states have internal predecessors, (55), 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-10 19:34:24,477 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 254 transitions. [2024-11-10 19:34:24,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-10 19:34:24,478 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:34:24,479 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:34:24,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 19:34:24,479 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2024-11-10 19:34:24,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:34:24,479 INFO L85 PathProgramCache]: Analyzing trace with hash 207170939, now seen corresponding path program 1 times [2024-11-10 19:34:24,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:34:24,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141546929] [2024-11-10 19:34:24,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:34:24,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:34:24,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 19:34:24,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [738447160] [2024-11-10 19:34:24,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:34:24,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:34:24,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:34:24,517 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-10 19:34:24,518 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-10 19:34:24,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:34:24,580 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 19:34:24,585 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:34:24,715 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-10 19:34:24,715 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 19:34:24,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:34:24,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141546929] [2024-11-10 19:34:24,716 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 19:34:24,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [738447160] [2024-11-10 19:34:24,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [738447160] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:34:24,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:34:24,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 19:34:24,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354309506] [2024-11-10 19:34:24,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:34:24,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 19:34:24,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:34:24,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 19:34:24,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 19:34:24,720 INFO L87 Difference]: Start difference. First operand 251 states and 254 transitions. Second operand has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 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-10 19:34:25,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:34:25,150 INFO L93 Difference]: Finished difference Result 431 states and 444 transitions. [2024-11-10 19:34:25,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 19:34:25,151 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 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 71 [2024-11-10 19:34:25,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:34:25,152 INFO L225 Difference]: With dead ends: 431 [2024-11-10 19:34:25,152 INFO L226 Difference]: Without dead ends: 366 [2024-11-10 19:34:25,153 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 68 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-10 19:34:25,154 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 112 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 19:34:25,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 170 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 19:34:25,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2024-11-10 19:34:25,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 359. [2024-11-10 19:34:25,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 273 states have (on average 1.3333333333333333) internal successors, (364), 349 states have internal predecessors, (364), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-10 19:34:25,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 378 transitions. [2024-11-10 19:34:25,165 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 378 transitions. Word has length 71 [2024-11-10 19:34:25,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:34:25,165 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 378 transitions. [2024-11-10 19:34:25,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 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-10 19:34:25,166 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 378 transitions. [2024-11-10 19:34:25,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-10 19:34:25,167 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:34:25,167 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:34:25,185 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-10 19:34:25,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-10 19:34:25,368 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2024-11-10 19:34:25,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:34:25,369 INFO L85 PathProgramCache]: Analyzing trace with hash 172770033, now seen corresponding path program 1 times [2024-11-10 19:34:25,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:34:25,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577066759] [2024-11-10 19:34:25,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:34:25,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:34:25,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:34:25,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 19:34:25,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:34:25,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-10 19:34:25,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:34:25,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 19:34:25,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:34:25,474 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-10 19:34:25,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:34:25,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577066759] [2024-11-10 19:34:25,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577066759] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:34:25,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:34:25,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 19:34:25,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005627733] [2024-11-10 19:34:25,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:34:25,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 19:34:25,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:34:25,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 19:34:25,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 19:34:25,477 INFO L87 Difference]: Start difference. First operand 359 states and 378 transitions. Second operand has 4 states, 3 states have (on average 23.0) internal successors, (69), 4 states have internal predecessors, (69), 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-10 19:34:25,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:34:25,779 INFO L93 Difference]: Finished difference Result 360 states and 378 transitions. [2024-11-10 19:34:25,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 19:34:25,779 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 23.0) internal successors, (69), 4 states have internal predecessors, (69), 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 78 [2024-11-10 19:34:25,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:34:25,781 INFO L225 Difference]: With dead ends: 360 [2024-11-10 19:34:25,781 INFO L226 Difference]: Without dead ends: 359 [2024-11-10 19:34:25,782 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-10 19:34:25,782 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 58 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 19:34:25,783 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 348 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 19:34:25,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2024-11-10 19:34:25,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 359. [2024-11-10 19:34:25,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 273 states have (on average 1.3296703296703296) internal successors, (363), 349 states have internal predecessors, (363), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-10 19:34:25,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 377 transitions. [2024-11-10 19:34:25,800 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 377 transitions. Word has length 78 [2024-11-10 19:34:25,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:34:25,801 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 377 transitions. [2024-11-10 19:34:25,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 23.0) internal successors, (69), 4 states have internal predecessors, (69), 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-10 19:34:25,801 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 377 transitions. [2024-11-10 19:34:25,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-10 19:34:25,804 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:34:25,804 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:34:25,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 19:34:25,805 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2024-11-10 19:34:25,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:34:25,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1060903795, now seen corresponding path program 1 times [2024-11-10 19:34:25,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:34:25,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378768240] [2024-11-10 19:34:25,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:34:25,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:34:25,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:34:25,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 19:34:25,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:34:25,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-10 19:34:25,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:34:25,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 19:34:25,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:34:25,942 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-10 19:34:25,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:34:25,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378768240] [2024-11-10 19:34:25,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378768240] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:34:25,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:34:25,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 19:34:25,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067494807] [2024-11-10 19:34:25,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:34:25,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 19:34:25,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:34:25,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 19:34:25,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 19:34:25,947 INFO L87 Difference]: Start difference. First operand 359 states and 377 transitions. Second operand has 4 states, 3 states have (on average 23.333333333333332) internal successors, (70), 4 states have internal predecessors, (70), 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-10 19:34:26,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:34:26,042 INFO L93 Difference]: Finished difference Result 360 states and 377 transitions. [2024-11-10 19:34:26,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 19:34:26,046 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 23.333333333333332) internal successors, (70), 4 states have internal predecessors, (70), 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 79 [2024-11-10 19:34:26,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:34:26,047 INFO L225 Difference]: With dead ends: 360 [2024-11-10 19:34:26,047 INFO L226 Difference]: Without dead ends: 359 [2024-11-10 19:34:26,048 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-10 19:34:26,048 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 52 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:34:26,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 333 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:34:26,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2024-11-10 19:34:26,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 359. [2024-11-10 19:34:26,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 273 states have (on average 1.326007326007326) internal successors, (362), 349 states have internal predecessors, (362), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-10 19:34:26,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 376 transitions. [2024-11-10 19:34:26,065 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 376 transitions. Word has length 79 [2024-11-10 19:34:26,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:34:26,066 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 376 transitions. [2024-11-10 19:34:26,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 23.333333333333332) internal successors, (70), 4 states have internal predecessors, (70), 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-10 19:34:26,066 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 376 transitions. [2024-11-10 19:34:26,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-10 19:34:26,070 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:34:26,070 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:34:26,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 19:34:26,071 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr63ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2024-11-10 19:34:26,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:34:26,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1666304962, now seen corresponding path program 1 times [2024-11-10 19:34:26,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:34:26,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48466226] [2024-11-10 19:34:26,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:34:26,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:34:26,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 19:34:26,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [949831019] [2024-11-10 19:34:26,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:34:26,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:34:26,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:34:26,111 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-10 19:34:26,112 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-10 19:34:26,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:34:26,173 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 19:34:26,175 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:34:26,503 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 19:34:26,504 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 19:34:26,804 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 19:34:26,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:34:26,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48466226] [2024-11-10 19:34:26,805 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 19:34:26,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [949831019] [2024-11-10 19:34:26,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [949831019] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 19:34:26,805 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 19:34:26,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-11-10 19:34:26,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801867872] [2024-11-10 19:34:26,806 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 19:34:26,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 19:34:26,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:34:26,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 19:34:26,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-10 19:34:26,808 INFO L87 Difference]: Start difference. First operand 359 states and 376 transitions. Second operand has 8 states, 7 states have (on average 30.857142857142858) internal successors, (216), 8 states have internal predecessors, (216), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-10 19:34:27,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:34:27,907 INFO L93 Difference]: Finished difference Result 385 states and 396 transitions. [2024-11-10 19:34:27,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 19:34:27,908 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 30.857142857142858) internal successors, (216), 8 states have internal predecessors, (216), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 121 [2024-11-10 19:34:27,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:34:27,910 INFO L225 Difference]: With dead ends: 385 [2024-11-10 19:34:27,910 INFO L226 Difference]: Without dead ends: 376 [2024-11-10 19:34:27,910 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2024-11-10 19:34:27,911 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 351 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 974 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 974 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-10 19:34:27,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 202 Invalid, 993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 974 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-10 19:34:27,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2024-11-10 19:34:27,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 364. [2024-11-10 19:34:27,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 281 states have (on average 1.295373665480427) internal successors, (364), 354 states have internal predecessors, (364), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-10 19:34:27,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 378 transitions. [2024-11-10 19:34:27,920 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 378 transitions. Word has length 121 [2024-11-10 19:34:27,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:34:27,921 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 378 transitions. [2024-11-10 19:34:27,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 30.857142857142858) internal successors, (216), 8 states have internal predecessors, (216), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-10 19:34:27,921 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 378 transitions. [2024-11-10 19:34:27,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-10 19:34:27,922 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:34:27,922 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:34:27,938 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 19:34:28,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-10 19:34:28,123 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2024-11-10 19:34:28,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:34:28,123 INFO L85 PathProgramCache]: Analyzing trace with hash -703729568, now seen corresponding path program 1 times [2024-11-10 19:34:28,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:34:28,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369779141] [2024-11-10 19:34:28,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:34:28,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:34:28,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 19:34:28,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1548027765] [2024-11-10 19:34:28,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:34:28,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:34:28,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:34:28,150 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-10 19:34:28,152 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-10 19:34:28,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:34:28,210 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-10 19:34:28,213 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:34:28,545 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 19:34:28,545 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 19:34:29,909 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 4 proven. 39 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 19:34:29,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:34:29,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369779141] [2024-11-10 19:34:29,910 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 19:34:29,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1548027765] [2024-11-10 19:34:29,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1548027765] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 19:34:29,910 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 19:34:29,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2024-11-10 19:34:29,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629736956] [2024-11-10 19:34:29,911 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 19:34:29,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 19:34:29,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:34:29,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 19:34:29,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-11-10 19:34:29,912 INFO L87 Difference]: Start difference. First operand 364 states and 378 transitions. Second operand has 9 states, 8 states have (on average 27.5) internal successors, (220), 9 states have internal predecessors, (220), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-10 19:34:32,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-10 19:34:34,655 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-10 19:34:39,803 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-10 19:34:43,806 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 [] [2024-11-10 19:34:51,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.53s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-10 19:34:58,363 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.31s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-10 19:34:59,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-10 19:35:04,782 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-10 19:35:07,988 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.21s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-10 19:35:11,031 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.35s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-10 19:35:16,612 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 [] [2024-11-10 19:35:20,931 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 [] [2024-11-10 19:35:23,769 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.84s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-10 19:35:29,176 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.30s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-10 19:35:39,240 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 10.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-10 19:35:40,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-10 19:35:46,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.31s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-10 19:35:50,924 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 [] [2024-11-10 19:35:53,943 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-10 19:35:55,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-10 19:36:01,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.90s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-10 19:36:02,733 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []